Bulk Eigenvalue Correlation Statistics of Random Biregular Bipartite Graphs
Kevin Yang

TL;DR
This paper studies the eigenvalue correlation statistics of random biregular bipartite graphs, demonstrating their stability and universality in the bulk spectrum, aligning with classical random matrix ensembles.
Contribution
It proves the stability and universality of bulk eigenvalue correlation statistics for these graphs, connecting them to GOE and Wishart ensembles.
Findings
Bulk eigenvalue correlations are stable for short times.
Universality matches graphs with GOE and Wishart ensembles.
Results hold for a range of degree parameters.
Abstract
This paper is the second chapter of three of the author's undergraduate thesis. In this paper, we consider the random matrix ensemble given by -regular graphs on black vertices and white vertices, where for any . We simultaneously prove that the bulk eigenvalue correlation statistics for both normalized adjacency matrices and their corresponding covariance matrices are stable for short times. Combined with an ergodicity analysis of the Dyson Brownian motion in another paper, this proves universality of bulk eigenvalue correlation statistics, matching normalized adjacency matrices with the GOE and the corresponding covariance matrices with the Gaussian Wishart Ensemble.
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 · Markov Chains and Monte Carlo Methods
