Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs

DOI10.1002/jgt.22551zbMath1521.05185arXiv1612.00731MaRDI QIDQ6055380

No author found.

Publication date: 29 September 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

random walkrandom graphhitting timeeffective resistanceKirchoff index

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Applications of branching processes (60J85) Combinatorial probability (60C05) Probabilistic potential theory (60J45) Connectivity (05C40) Random walks on graphs (05C81)

Related Items

Resistance distance distribution in large sparse random graphs, La métrica de resistencia efectiva

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concentration of the Kirchhoff index for Erdős-Rényi graphs
• Spectral statistics of Erdős-Rényi graphs II: eigenvalue spacing and the extreme eigenvalues
• Random walks and the effective resistance of networks
• The electrical resistance of a graph captures its commute and cover times
• On hitting times for a simple random walk on dense Erdös-Rényi random graphs
• Probability on Trees and Networks
• Hitting and commute times in large graphs are often misleading
• Hitting Times, Cover Cost, and the Wiener Index of a Tree
• The cover time of sparse random graphs
• Closed-form Expressions for the Moments of the Binomial Probability Distribution
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• On the Cover Time for Random Walks on Random Graphs
• On the Laplacian Eigenvalues of G_n,p
• The diameter of sparse random graphs