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...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IOP Publishing
2023-01-01
|
Series: | Journal of Physics: Complexity |
Subjects: | |
Online Access: | https://doi.org/10.1088/2632-072X/acb8f7 |