Edge rigidity and universality of random regular graphs of intermediate degree

From MaRDI portal
Publication:2201984

DOI10.1007/S00039-020-00538-0zbMATH Open1453.05117arXiv1910.10121OpenAlexW2981994428MaRDI QIDQ2201984FDOQ2201984

Jiaoyang Huang, Antti Knowles, Horng-Tzer Yau, Roland Bauerschmidt

Publication date: 17 September 2020

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Abstract: For random d-regular graphs on N vertices with 1lldllN2/3, we develop a d1/2 expansion of the local eigenvalue distribution about the Kesten-McKay law up to order d3. This result is valid up to the edge of the spectrum. It implies that the eigenvalues of such random regular graphs are more rigid than those of ErdH{o}s-R'enyi graphs of the same average degree. As a first application, for 1lldllN2/3, we show that all nontrivial eigenvalues of the adjacency matrix are with very high probability bounded in absolute value by (2+o(1))sqrtd1. As a second application, for N2/9lldllN1/3, we prove that the extremal eigenvalues are concentrated at scale N2/3 and their fluctuations are governed by Tracy-Widom statistics. Thus, in the same regime of d, 52% of all d-regular graphs have second-largest eigenvalue strictly less than 2sqrtd1.


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





Cites Work


Cited In (16)


   Recommendations





This page was built for publication: Edge rigidity and universality of random regular graphs of intermediate degree

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