Central limit theorem for the principal eigenvalue and eigenvector of Chung–Lu random graphs
Journal of Physics Complexity, vol. 4, pp. 015008
Abstract
Abstract A Chung–Lu random graph is an inhomogeneous Erdős–Rényi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is proportional to the product of their average degrees, independently for different edges. We derive a central limit theorem for the principal eigenvalue and the components of the principal eigenvector of the adjacency matrix of a Chung–Lu random graph. Our derivation requires certain assumptions on the average degrees that guarantee connectivity, sparsity and bounded inhomogeneity of the graph.
Authors 5
-
Affiliation as printed
Mathematical Institute, Leiden University, PO Box 9512, 2300 RA Leiden, The Netherlands
-
Leiden University · IMT School for Advanced Studies Lucca · Istituto Nazionale di Alta Matematica Francesco Severi
Affiliation as printed
IMT School for Advanced Studies, Piazza S. Francesco 19, 55100 Lucca, Italy
INDAM-GNAMPA Istituto Nazionale di Alta Matematica ‘Francesco Severi’, Piazzale Aldo Moro 5, 00185 Roma, Italy
Lorentz Institute for Theoretical Physics, Leiden University, PO Box 9504, 2300 RA Leiden, The Netherlands
-
Affiliation as printed
Mathematical Institute, Leiden University, PO Box 9512, 2300 RA Leiden, The Netherlands
-
Affiliation as printed
Mathematical Institute, Leiden University, PO Box 9512, 2300 RA Leiden, The Netherlands
-
Affiliation as printed
Korteweg–de Vries Institute, University of Amsterdam, PO Box 94248, 1090 GE Amsterdam, The Netherlands
Cited by 2 stored of 2
2 results
No patents citing this paper on Lens.org (checked 2026-10-11).