Asymptotics of the partition function for random matrices via Riemann-Hilbert techniques, and applications to graphical enumeration

Abstract

We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal polynomials. We obtain the first proof of a complete large N expansion for the partition function, for a general class of probability measures on matrices, originally conjectured by Bessis, Itzykson, and Zuber. We prove that the coefficients in the asymptotic expansion are analytic functions of parameters in the original probability measure, and that they are generating functions for the enumeration of labelled maps according to genus and valence. Central to the analysis is a large N expansion for the mean density of eigenvalues, uniformly valid on the entire real axis.

44 pages, 4 figures. To appear, International Mathematics Research Notices

Cited by in corpus (10)

• Exact Solution of the Six-Vertex Model with Domain Wall Boundary Conditions. Disordered Phase
• Asymptotics of unitary and othogonal matrix integrals
• Combinatorics of dispersionless integrable systems and universality in random matrix theory
• Multi-instantons in minimal string theory and in matrix integrals
• Large deviations of radial statistics in the two-dimensional one-component plasma
• Fine structure in the large n limit of the non-hermitian Penner matrix model
• Two-dimensional Yang-Mills theory, Painleve equations and the six-vertex model
• On the proof of universality for orthogonal and symplectic ensembles in random matrix theory
• Free probability, Planar algebras, Subfactors and Random Matrices
• Topological expansion of unitary integrals and maps