Hitting times in the binomial random graph

DOI10.1002/JGT.70057MaRDI QIDQ7314107zbMATH OpenFDO

Authors Bertille Granet, Felix Joos, Jonathan Schrodt

Publication date 13 August 2026

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.70057

Mathematics Subject Classification ID

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

Cites work

• A central limit theorem for the average target hitting time for a random walk on a random graph
• A central limit theorem for the mean starting hitting time for a random walk on a random graph
• Bounds on expected hitting times for a random walk on a connected graph
• Concentration of hitting times in Erdős-Rényi graphs
• Entrywise bounds for eigenvectors of random graphs
• Expected hitting and cover times of random walks on some special graphs
• Finding hitting times in various graphs
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• On hitting times for a simple random walk on dense Erdös-Rényi random graphs
• On hitting times of random walks on trees
• On the Cover Time for Random Walks on Random Graphs
• Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
• Spectral norm of random matrices
• The cover time of sparse random graphs
• The cover time of the giant component of a random graph
• The Diameter of Random Graphs
• The eigenvalues of random symmetric matrices
• The Largest Eigenvalue of Sparse Random Graphs

This page was built for publication: Hitting times in the binomial random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314107)