English

A semicircle law for the normalized Laplacian of sparse random graphs

Probability 2026-01-01 v2

Abstract

We study the limiting spectral distribution of the normalized Laplacian L\mathcal L of an Erd\H{o}s-R\'enyi graph G(n,p)G(n,p). To account for the presence of isolated vertices in the sparse regime, we define L\mathcal L using the Moore-Penrose pseudoinverse of the degree matrix. Under this convention, we show that the empirical spectral distribution of a suitably normalized L\mathcal L converges weakly in probability to the semicircle law whenever npnp\to\infty, thereby providing a rigorous justification of a prediction made in (Akara-pipattana and Evnin, 2023). Moreover, if np>logn+ω(1)np>\log n+\omega(1), so that G(n,p)G(n,p) has no isolated vertices with high probability, the same conclusion holds for the standard definition of L\mathcal L. We further strengthen this result to almost sure convergence when np=Ω(logn)np=\Omega(\log n). Finally, we extend our approach to the Chung-Lu random graph model, where we establish a semicircle law for L\mathcal L itself, improving upon (Chung, Lu, and Vu 2003), which obtained the semicircle law only for a proxy matrix.

Cite

@article{arxiv.2512.20146,
  title  = {A semicircle law for the normalized Laplacian of sparse random graphs},
  author = {Yiming Chen and Zijun Chen and Yizhe Zhu},
  journal= {arXiv preprint arXiv:2512.20146},
  year   = {2026}
}