Mean Field Behavior during the Big Bang Regime for Coalescing Random Walks

preprint2022arXivOpen access

Abstract

In this paper we consider coalescing random walks on a general connected graph G=(V,E)G=(V,E). We set up a unified framework to study the leading order of the decay rate of PtP_t, the expectation of the fraction of occupied sites at time tt, particularly for the `Big Bang' regime where t≪tcoal:=E[inf⁡{s:There is only one particle at time s}]t\ll t_{\text{coal}}:=\mathbb{E}[\inf\{s:\text{There is only one particle at time }s\}]. Our results show that PtP_t satisfies certain mean field behavior, if the graphs satisfy certain transience-like conditions. We apply this framework to two families of graphs: (1) graphs given by the configuration model with a degree distribution supported in [3,dˉ][3,\bar d] for some dˉ≥3\bar d\geq 3, and (2) finite and infinite vertex-transitive graphs. In the first case, we show that for 1≪t≪∣V∣1 \ll t \ll |V|, PtP_t decays in the order of t−1t^{-1}, and (tPt)−1(tP_t)^{-1} is approximately the probability that two particles starting from the root of the corresponding unimodular Galton-Watson tree never collide after one of them leaves the root, which is also roughly ∣V∣/(2tmeet)|V|/(2t_{\text{meet}}), where tmeett_{\text{meet}} is the mean meeting time of two walkers. By taking the local weak limit, for the unimodular Galton-Watson tree we prove the convergence of tPttP_t as t→∞t\to\infty. For the second family of graphs, if we take a sequence of finite graphs Gn=(Vn,En)G_n=(V_n, E_n), such that tmeet=O(∣Vn∣)t_{\text{meet}}=O(|V_n|) and the inverse of the spectral gap trelt_{\text{rel}} is o(∣Vn∣)o(|V_n|), then for trel≪t≪tcoalt_{\text{rel}}\ll t\ll t_{\text{coal}}, (tPt)−1(tP_t)^{-1} is approximately the probability that two random walks never meet before time tt, and also ∣V∣/(2tmeet)|V|/(2t_{\text{meet}}). In addition, we define a natural uniform transience condition, and show that it implies the above for all 1≪t≪tcoal1\ll t\ll t_{\text{coal}}. Such estimates of tPttP_t are also obtained for all infinite transient transitive unimodular graphs, in particular, all transient transitive amenable graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.