Convergence of blanket times for sequences of random walks on critical random graphs
Combinatorics, Probability and Computing · 2023-05 · 32 (3) · 478-515
DOI: 10.1017/s0963548322000359 ↗Kurz gefasst
Fachartikel in der Zeitschrift Combinatorics, Probability and Computing, online erschienen am 09.01.2023. Verfasst von George Andriopoulos. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 40 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Andriopoulos, G. (2023). Convergence of blanket times for sequences of random walks on critical random graphs. Combinatorics, Probability and Computing, 32(3), 478-515. https://doi.org/10.1017/s0963548322000359
Vancouver
Andriopoulos G. Convergence of blanket times for sequences of random walks on critical random graphs. Combinatorics, Probability and Computing. 2023;32(3):478-515. doi:10.1017/s0963548322000359
BibTeX
@article{Andriopoulos2023,
author = {Andriopoulos, George},
title = {Convergence of blanket times for sequences of random walks on critical random graphs},
journal = {Combinatorics, Probability and Computing},
year = {2023},
volume = {32},
number = {3},
pages = {478--515},
doi = {10.1017/s0963548322000359}
}
EUVIMED