Cycles and eigenvalues of sequentially growing random regular graphs

From MaRDI portal
Publication:400565

DOI10.1214/13-AOP864zbMATH Open1355.60012arXiv1203.1113MaRDI QIDQ400565FDOQ400565

Soumik Pal, Tobias Johnson

Publication date: 22 August 2014

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: Consider the sum of d many i.i.d. random permutation matrices on n labels along with their transposes. The resulting matrix is the adjacency matrix of a random regular (multi)-graph of degree 2d on n vertices. It is known that the distribution of smooth linear eigenvalue statistics of this matrix is given asymptotically by sums of Poisson random variables. This is in contrast with Gaussian fluctuation of similar quantities in the case of Wigner matrices. It is also known that for Wigner matrices the joint fluctuation of linear eigenvalue statistics across minors of growing sizes can be expressed in terms of the Gaussian Free Field (GFF). In this article, we explore joint asymptotic (in n) fluctuation for a coupling of all random regular graphs of various degrees obtained by growing each component permutation according to the Chinese Restaurant Process. Our primary result is that the corresponding eigenvalue statistics can be expressed in terms of a family of independent Yule processes with immigration. These processes track the evolution of short cycles in the graph. If we now take d to infinity, certain GFF-like properties emerge.


Full work available at URL: https://arxiv.org/abs/1203.1113




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Cycles and eigenvalues of sequentially growing random regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400565)