Convergence of mixing times for sequences of random walks on finite graphs

DOI10.1214/EJP.v17-1705zbMath1244.05207arXiv1111.0108OpenAlexW2055952240MaRDI QIDQ428604

David A. Croydon, Takashi Kumagai, Benjamin M. Hambly

Publication date: 22 June 2012

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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

zbMATH Keywords

mixingrandom walkGalton-Watson treerandom graphGromov-Hausdorff convergencefractal graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Related Items (10)

Scaling limits of stochastic processes associated with resistance forms ⋮ Metrization of the Gromov-Hausdorff (-Prokhorov) topology for boundedly-compact metric spaces ⋮ Convergence of blanket times for sequences of random walks on critical random graphs ⋮ The Brownian Web as a random \(\mathbb{R} \)-tree ⋮ A unified framework for generalizing the Gromov-Hausdorff metric ⋮ The GHP scaling limit of uniform spanning trees in high dimensions ⋮ Random walk on the high-dimensional IIC ⋮ Cover times for sequences of reversible Markov chains on random graphs ⋮ Brownian motion on stable looptrees ⋮ Quenched invariance principles for random walks and elliptic diffusions in random media with boundary

This page was built for publication: Convergence of mixing times for sequences of random walks on finite graphs