Hostname: page-component-74656f9884-kv2lp Total loading time: 0 Render date: 2026-11-06T07:42:02.837Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  09 January 2023

George Andriopoulos*
Affiliation:
NYU-ECNU Institute of Mathematical Sciences at NYU Shanghai, China.
Rights & Permissions [Opens in a new window]

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 $\varepsilon$-blanket times of the random walks in the sequence. The precise nature of these bounds ensures convergence of the $\varepsilon$-blanket times of the random walks if the $\varepsilon$-blanket time of the limiting diffusion is continuous at $\varepsilon$ with probability 1. This result enables us to prove annealed convergence in various examples of critical random graphs, including critical Galton-Watson trees and the Erdős-Rényi random graph in the critical window. We highlight that proving continuity of the $\varepsilon$-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.

Information

Type
Paper
Copyright
© The Author(s), 2023. Published by Cambridge University Press