Recursive characterisations of random matrix ensembles and associated combinatorial objects
Anas A. Rahman

TL;DR
This paper reviews recursive methods for analyzing classical and product random matrix ensembles, deriving differential equations, recursions, and combinatorial interpretations to understand eigenvalue statistics and correlations.
Contribution
It introduces new recursive schemes and differential equations for classical and product ensembles, linking them to combinatorial ribbon graph interpretations.
Findings
Derived linear differential equations for eigenvalue densities.
Established 1-point recursions analogous to Harer-Zagier.
Connected matrix ensemble statistics to ribbon graph combinatorics.
Abstract
We give an overview of the recursive characterisations of random matrix ensembles that are currently at the forefront of random matrix theory by way of studying two classes of ensembles using two different types of recursive schemes: Established theory on Selberg correlation integrals is used to derive linear differential equations on the eigenvalue densities and resolvents of the classical matrix ensembles, which lead to -point recursions, understood to be analogues of the Harer-Zagier recursion, for the expansion coefficients of the associated -point cumulants, while loop equation analysis is used to recursively compute some leading order correlator expansion coefficients pertaining to certain products of random matrices that have recently come into interest due to their connections to Muttalib-Borodin ensembles and integrals of Harish-Chandra-Itzykson-Zuber type. We also show…
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 Algebra and Geometry · Spectral Theory in Mathematical Physics
