Papers › The Spectral Distribution of Random Graphs with Given Degree Sequences
The Spectral Distribution of Random Graphs with Given Degree Sequences
Shuyi Wang, Kevin Li, Jiaoyang Huang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this article, we study random graphs with a given degree sequence d₁, d₂, ⋯, dₙ 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 (d₁=d₂=⋯=dₙ=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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections