Concentration of hitting times in Erdős-Rényi graphs

DOI10.1002/jgt.23119zbMath1547.05267MaRDI QIDQ6606320

Stefan Steinerberger, Andrea Ottolini

Publication date: 16 September 2024

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

zbMATH Keywords

random walkhitting timeErdős-Rényi graphs

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Sums of independent random variables; random walks (60G50) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• The eigenvalues of random symmetric matrices
• Hitting times, commute times, and cover times for random walks on random hypergraphs
• Entrywise bounds for eigenvectors of random graphs
• On hitting times for a simple random walk on dense Erdös-Rényi random graphs
• Fractals in Probability and Analysis
• Hitting and commute times in large graphs are often misleading
• Diameters of Random Graphs
• First-passage properties of the Erdos–Renyi random graph
• Über stochastische Asymptoten und Grenzwerte.
• The diameter of sparse random graphs
• On quantitative convergence to quasi-stationarity
• Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
• A central limit theorem for the mean starting hitting time for a random walk on a random graph

This page was built for publication: Concentration of hitting times in Erdős-Rényi graphs