arXiv Analytics

Sign in

arXiv:1504.05170 [math.PR]AbstractReferencesReviewsResources

Bulk universality of sparse random matrices

Jiaoyang Huang, Benjamin Landon, Horng-Tzer Yau

Published 2015-04-20Version 1

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.

Related articles: Most relevant | Search more
arXiv:2501.16444 [math.PR] (Published 2025-01-27)
Extremal eigenvectors of sparse random matrices
arXiv:1904.07140 [math.PR] (Published 2019-04-15)
Bulk eigenvalue fluctuations of sparse random matrices
arXiv:1201.2283 [math.PR] (Published 2012-01-11, updated 2012-08-21)
Bulk Universality of General $β$-Ensembles with Non-convex Potential