Convergence of blanket times for sequences of random walks on critical random graphs

Abstract

Under the assumption that sequences of graphs equipped with resistances, associated measures, walks and local times converge in a suitable Gromov-Hausdorff topology, we establish asymptotic bounds on the distribution of the $\epsilon$-blanket times of the random walks in the sequence. The precise nature of these bounds ensures convergence of the $\epsilon$-blanket times of the random walks if the $\epsilon$-blanket time of the limiting diffusion is continuous with probability one at $\epsilon$. This result enables us to prove annealed convergence in various examples of critical random graphs, including critical Galton-Watson trees, the Erdős-Rényi random graph in the critical window and the configuration model in the scaling critical window. We highlight that proving continuity of the $\epsilon$-blanket time of the limiting diffusion relies on the scale invariance of a finite measure that gives rise to realizations of the limiting compact random metric space, and therefore we expect our results to hold for other examples of random graphs with a similar scale invariance property.

References in corpus (6)

• A note on Gromov-Hausdorff-Prokhorov distance between (locally) compact measure spaces
• Hausdorff measure of arcs and Brownian motion on Brownian spatial trees
• Moduli of continuity of local times of random walks on graphs in terms of the resistance metric
• Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
• Scaling limits of discrete snakes with stable branching
• Scaling limits of stochastic processes associated with resistance forms

Cited by in corpus (1)

• Invariance principles for random walks in random environment on trees