A semicircle law for the normalized Laplacian of sparse random graphs
Abstract
We study the limiting spectral distribution of the normalized Laplacian of an Erd\H{o}s-R\'enyi graph . To account for the presence of isolated vertices in the sparse regime, we define using the Moore-Penrose pseudoinverse of the degree matrix. Under this convention, we show that the empirical spectral distribution of a suitably normalized converges weakly in probability to the semicircle law whenever , thereby providing a rigorous justification of a prediction made in (Akara-pipattana and Evnin, 2023). Moreover, if , so that has no isolated vertices with high probability, the same conclusion holds for the standard definition of . We further strengthen this result to almost sure convergence when . Finally, we extend our approach to the Chung-Lu random graph model, where we establish a semicircle law for 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}
}