Bulk universality of sparse random matrices

Abstract

We consider the adjacency matrix of the ensemble of Erdos-R\'enyi random graphs which consists of graphs on N vertices in which each edge occurs independently with probability p. We prove that in the regime pN 1 these matrices exhibit bulk universality in the sense that both the averaged n-point correlation functions and distribution of a single eigenvalue gap coincide with those of the GOE. Our methods extend to a class of random matrices which includes sparse ensembles whose entries have different variances.

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…