Concentration of the Kirchhoff index for Erdős-Rényi graphs

DOI10.1016/j.sysconle.2014.10.006zbMath1300.93151arXiv1307.6398OpenAlexW1988895595MaRDI QIDQ473412

Xiuyuan Cheng, Nicolas Boumal

Publication date: 24 November 2014

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.6398

zbMATH Keywords

random matricessynchronizationresistance distanceKirchhoff indexErdős-Rényi random graphsensor network localizationCramér-Rao boundsestimation on graphspseudoinverse of graph Laplacian

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items

Resistance distance distribution in large sparse random graphs, Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs, Group synchronization on grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rotation averaging
• Spectral distributions of adjacency and Laplacian matrices of random graphs
• Angular synchronization by eigenvectors and semidefinite programming
• The electrical resistance of a graph captures its commute and cover times
• Noisy dynamic simulations in the presence of symmetry: data alignment and model reduction
• Eigenvector synchronization, graph rigidity and the molecule problem
• Expander graphs and their applications
• Distance in graphs
• On Intrinsic Cramér-Rao Bounds for Riemannian Submanifolds and Quotient Manifolds
• The Spectra of Random Graphs with Given Expected Degrees
• Exact and stable recovery of rotations for robust synchronization
• Cramer-Rao bounds for synchronization of rotations