Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs
From MaRDI portal
Publication:6404324
arXiv2207.03531MaRDI QIDQ6404324FDOQ6404324
Authors: Pierfrancesco Dionigi, Diego Garlaschelli, Rajat Subhra Hazra, F. den Hollander, M. R. H. Mandjes 
Publication date: 7 July 2022
Abstract: A Chung-Lu random graph is an inhomogeneous ErdH{o}s-R'enyi 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 matrices (probabilistic aspects) (60B20) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)
This page was built for publication: Central limit theorem for the principal eigenvalue and eigenvector of Chung-Lu random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404324)
