Edge Universality of Random Regular Graphs of Growing Degrees
Abstract
We consider the statistics of extreme eigenvalues of random d-regular graphs, with N c≤ d≤ N1/3- c for arbitrarily small c>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 2d-1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.