Eigenvalue fluctuations for random regular graphs
arXiv:1406.7043
Abstract
One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe the edges of universality by studying the spectral properties of random regular graphs. Specifically, we prove limit theorems for the fluctuations of linear spectral statistics of random regular graphs. We find both universal and non-universal behavior. Our most important tool is Stein's method for Poisson approximation, which we develop for use on random regular graphs. This is my Ph.D. thesis, based on joint work with Ioana Dumitriu, Elliot Paquette, and Soumik Pal. For the most part, it's a mashed up version of arXiv:1109.4094, arXiv:1112.0704, and arXiv:1203.1113, but some things in here are improved or new. In particular, Chapter 4 goes into more detail on some of the proofs than arXiv:1203.1113 and includes a new section. See Section 1.3 for more discussion on what's new and who contributed to what.
arXiv comment103 pages; Ph.D. thesis at the University of Washington, 2014
References in corpus (13)
- Local semicircle law and complete delocalization for Wigner random matrices
- Random matrices: Universality of local eigenvalue statistics up to the edge
- Asymptotics of uniformly random lozenge tilings of polygons. Gaussian free field
- Functional limit theorems for random regular graphs
- General beta Jacobi corners process and the Gaussian Free Field
- Exchangeable pairs, switchings, and random regular graphs
- Random regular graphs of non-constant degree: Concentration of the chromatic number
- Cycles and eigenvalues of sequentially growing random regular graphs
- Why random matrices share universal processes with interacting particle systems?
- The Dyson Brownian minor process
- Multilevel Dyson Brownian motions via Jack polynomials
- The Gaussian free field in interlacing particle systems
- Quantitative Small Subgraph Conditioning