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

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

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...

Full description

Bibliographic Details
Main Authors: Pierfrancesco Dionigi, Diego Garlaschelli, Rajat Subhra Hazra, Frank den Hollander, Michel Mandjes
Format: Article
Language:English
Published: IOP Publishing 2023-01-01
Series:Journal of Physics: Complexity
Subjects:
Chung–Lu random graph
adjacency matrix
principal eigenvalue and eigenvector
central limit theorem
Online Access:https://doi.org/10.1088/2632-072X/acb8f7

Similar Items

Similar Items