Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs

Dionigi, P.; Garlaschelli, D.; Hollander, W.T.F. den; Hazra, R.S.; Mandjes, M.

doi:doi:10.1088/2632-072X/acb8f7

Persistent URL of this record https://hdl.handle.net/1887/3589987

View statistics

In Collections

This item can be found in the following collections:

Dionigi, P.; Garlaschelli, D.; Hollander, W.T.F. den; Hazra, R.S.; Mandjes, M. (2023)

Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs

Article / Letter to editor

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.

Random Graph

Spectral Graph Theory

Central Limit Theorem

Statistical Physics