Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs
| Authors |
|
|---|---|
| Publication date | 03-2023 |
| Journal | Journal of Physics: Complexity |
| Article number | 015008 |
| Volume | Issue number | 4 | 1 |
| Number of pages | 23 |
| Organisations |
|
| 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. |
| Document type | Article |
| Language | English |
| Published at | https://doi.org/10.1088/2632-072X/ACB8F7 |
| Downloads |
Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs
(Final published version)
|
| Permalink to this page | |