Choose timezone
Your profile timezone:
We show that specific exponential integrals serve as generating functions of labeled edge-colored graphs. Based on this, we derive asymptotics for the number of edge-colored graphs with arbitrary weights assigned to different vertex structures. The asymptotic behavior is governed by the critical points of a polynomial. As an application, we discuss the Ising model on a random graph and show how its phase transitions arise from our formula.
Ben Webster, Wenjun Niu