Edge Universality of Random Regular Graphs of Growing Degrees

From MaRDI portal



Abstract: We consider the statistics of extreme eigenvalues of random d-regular graphs, with NmathfrakcleqdleqN1/3−mathfrakc for arbitrarily small mathfrakc>0. We prove that in this regime, the fluctuations of extreme eigenvalues are given by the Tracy-Widom distribution. As a consequence, about 69% of d-regular graphs have all nontrivial eigenvalues bounded in absolute value by 2sqrtd−1.












This page was built for publication: Edge Universality of Random Regular Graphs of Growing Degrees

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