Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdos-R\'enyi graphs

Abstract

We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random matrices that includes the normalized adjacency matrices of the Erdos-R\'enyi graph G(N,p). Tracy-Widom fluctuations of the extreme eigenvalues for p N-2/3 was proved in [17,46]. We prove that there is a crossover in the behavior of the extreme eigenvalues at p N-2/3. In the case that N-7/9 p N-2/3, we prove that the extreme eigenvalues have asymptotically Gaussian fluctuations. Under a mean zero condition and when p=CN-2/3, we find that the fluctuations of the extreme eigenvalues are given by a combination of the Gaussian and the Tracy-Widom distribution. These results show that the eigenvalues at the edge of the spectrum of sparse Erdos-R\'enyi graphs are less rigid than those of random d-regular graphs [4] of the same average degree.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…