Moments of normally distributed random matrices - Bijective explicit evaluation
Ekaterina A. Vassilieva

TL;DR
This paper derives explicit formulas for the moments of eigenvalue distributions of certain random matrices, using combinatorial and symmetric function techniques, extending previous work to complex-valued matrices.
Contribution
It provides a bijective combinatorial method to evaluate moments of eigenvalues for random matrices involving symmetric and hermitian matrices, connecting hypermap enumeration with symmetric functions.
Findings
Explicit evaluation of moments in terms of monomial symmetric functions
Bijective correspondence between hypermaps and decorated forests
Extension of results to complex-valued matrices with hermitian matrices
Abstract
This paper is devoted to the distribution of the eigenvalues of where and are given symmetric matrices and is a random real valued square matrix of standard normal distribution. More specifically we look at its moments, i.e. the mathematical expectation of the trace of for arbitrary integer . Hanlon, Stanley, Stembridge (1992) showed that this quantity can be expressed in terms of some generating series for the connection coefficients of the double cosets of the hyperoctahedral group with the eigenvalues of and as indeterminate. We provide an explicit evaluation of these series in terms of monomial symmetric functions. Our development relies on an interpretation of the connection coefficients in terms of locally orientable hypermaps and a new bijective construction between partitioned locally orientable hypermaps and some decorated forests.…
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
TopicsAdvanced Combinatorial Mathematics · Random Matrices and Applications · Advanced Algebra and Geometry
