The Spectral Distribution of Random Graphs with Given Degree Sequences

Abstract

In this article, we study random graphs with a given degree sequence d1, d2, ·s, dn from the configuration model. We show that under mild assumptions of the degree sequence, the spectral distribution of the normalized Laplacian matrix of such random graph converges in distribution to the semicircle distribution as the number of vertices n→ ∞. This extends work by McKay (1981) and Tran, Vu and Wang (2013) which studied random regular graphs (d1=d2=·s=dn=d). Furthermore, we extend the assumption to show that a slightly more general condition is equivalent to the weak convergence to semicircle distribution. The equivalence is also illustrated by numerical simulations.

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…