A semicircle law for the normalized Laplacian of sparse random graphs

Abstract

We study the limiting spectral distribution of the normalized Laplacian L of an Erdos-R\'enyi graph G(n,p). To account for the presence of isolated vertices in the sparse regime, we define 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 converges weakly in probability to the semicircle law whenever np∞, thereby providing a rigorous justification of a prediction made in (Akara-pipattana and Evnin, 2023). Moreover, if np> n+ω(1), so that G(n,p) has no isolated vertices with high probability, the same conclusion holds for the standard definition of L. We further strengthen this result to almost sure convergence when np=( n). Finally, we extend our approach to the Chung-Lu random graph model, where we establish a semicircle law for L itself, improving upon (Chung, Lu, and Vu 2003), which obtained the semicircle law only for a proxy matrix.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…