Resistance distance distribution in large sparse random graphs

DOI10.1088/1742-5468/ac57baOpenAlexW4287067925MaRDI QIDQ5078649

Pawat Akara-Pipattana, Oleg Evnin, Thiparat Chotibut

Publication date: 23 May 2022

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

zbMATH Keywords

networksrandom graphsrandom matrix theory and extensions

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Related Items (2)

Random matrices with row constraints and eigenvalue distributions of graph Laplacians ⋮ Graph clustering with Boltzmann machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degree resistance distance of cacti
• Concentration of the Kirchhoff index for Erdős-Rényi graphs
• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• Random walks and the effective resistance of networks
• Statistical field theory for neural networks
• Reconstruction of graphs based on random walks
• Submean variance bound for effective resistance of random electric networks
• Geodesic distance in planar graphs
• Quantum field theory in the large \(N\) limit: a review
• Spectra of Euclidean random matrices
• On the Lambert \(w\) function
• The degree resistance distance of cacti
• On random matrix averages involving half-integer powers of GOE characteristic polynomials
• On the cover time and mixing time of random geometric graphs
• Asymptotic Approximations of Integrals
• Complexity of Random Energy Landscapes, Glass Transition, and Absolute Value of the Spectral Determinant of Random Matrices
• Hitting and commute times in large graphs are often misleading
• The cover time of random geometric graphs
• Theory of resistor networks: the two-point resistance
• The two-star model: exact solution in the sparse regime and condensation transition
• The overlapping coefficient as a measure of agreement between probability distributions and point estimation of the overlap of two normal densities
• Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component
• Universality of level correlation function of sparse random matrices
• Supersymmetry in Disorder and Chaos
• Minimizing Effective Resistance of a Graph
• Asymptotic Enumeration of Spanning Trees
• Networks
• Random incidence matrices: moments of the spectral density
• Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs

This page was built for publication: Resistance distance distribution in large sparse random graphs