pith. sign in

arxiv: 1504.05170 · v2 · pith:RGYQYOVHnew · submitted 2015-04-20 · 🧮 math.PR · math-ph· math.MP

Bulk universality of sparse random matrices

classification 🧮 math.PR math-phmath.MP
keywords matricesrandombulkgraphssparseuniversalityadjacencyaveraged
0
0 comments X
read the original abstract

We consider the adjacency matrix of the ensemble of Erd\H{o}s-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 \gg 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.