Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs
arXiv:2207.03531 · doi:10.1088/2632-072X/acb8f7
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.
References in corpus (14)
- Finding community structure in networks using the eigenvectors of matrices
- Localization and centrality in networks
- Spectral Statistics of Erd{\H o}s-Rényi Graphs II: Eigenvalue Spacing and the Extreme Eigenvalues
- Analytical maximum-likelihood method to detect patterns in real networks
- The largest eigenvalue of rank one deformation of large Wigner matrices
- The largest eigenvalues of finite rank deformation of large Wigner matrices: convergence and nonuniversality of the fluctuations
- Spectral statistics of Erdős-Rényi graphs I: Local semicircle law
- Central limit theorems for eigenvalues in a spiked population model
- Breaking of ensemble equivalence in networks
- Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects
- Eigenvector localization in real networks and its implications for epidemic spreading
- The largest eigenvalues of sample covariance matrices for a spiked population: diagonal case
- Covariance structure behind breaking of ensemble equivalence in random graphs
- A spectral signature of breaking of ensemble equivalence for constrained random graphs