Random Matrices, Graphical Enumeration and the Continuum Limit of Toda Lattices
N. M. Ercolani, K. D. T-R McLaughlin, and V. U. Pierce

TL;DR
This paper develops a hierarchy of differential equations to determine asymptotic expansion coefficients of the logarithm of the partition function for large Hermitian random matrices, linking them to graphical enumeration on Riemann surfaces.
Contribution
It introduces a recursive method to explicitly compute asymptotic coefficients as functions of coupling parameters, extending to multiple parameters.
Findings
Derived differential equations for asymptotic coefficients.
Explicit recursive formulas for coefficients as functions of coupling.
Extended analysis to multiple coupling parameters.
Abstract
In this paper we derive a hierarchy of differential equations which uniquely determine the coefficients in the asymptotic expansion, for large , of the logarithm of the partition function of Hermitian random matrices. These coefficients are generating functions for graphical enumeration on Riemann surfaces. The case that we particularly consider is for an underlying measure that differs from the Gaussian weight by a single monomial term of degree . The coupling parameter for this term plays the role of the independent dynamical variable in the differential equations. From these equations one may deduce functional analytic characterizations of the coefficients in the asymptotic expansion. Moreover, this ode system can be solved recursively to explicitly construct these coefficients as functions of the coupling parameter. This analysis of the fine structure of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Advanced Combinatorial Mathematics · Advanced Algebra and Geometry
