Mean field behavior during the big bang regime for coalescing random walks

DOI10.1214/22-AOP1571MaRDI QIDQ2085541zbMATH OpenFDO

Authors Jonathan Hermon, Shuangping Li, Dong Yao, Lingfu Zhang

Publication date 18 October 2022

Published in The Annals of Probability (Search for Journal in Brave)

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

zbMATH Keywords

coalescing random walksKingman's coalescent

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Continuous-time Markov processes on discrete state spaces (60J27) Coalescent processes (60J90)

Abstract: In this paper we consider coalescing random walks on a general connected graph $G=(V,E)$. We set up a unified framework to study the leading order of the decay rate of $P_t$, the expectation of the fraction of occupied sites at time $t$, particularly for the `Big Bang' regime where $tll{t}_{extcoal}:=mathbbE[infs:extThereisonlyoneparticleattimes]$. Our results show that $P_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 $$ for some $$, and (2) finite and infinite vertex-transitive graphs. In the first case, we show that for $1lltll|V|$, $P_t$ decays in the order of $t^{-1}$, and $(t{P}_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|/(2t_{extmeet})$, where $t_{extmeet}$ 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 $t{P}_t$ as $toinfty$. For the second family of graphs, if we take a sequence of finite graphs $G_n=(V_n,E_n)$, such that $t_{extmeet}=O(|V_n|)$ and the inverse of the spectral gap $t_{extrel}$ is $o(|V_n|)$, then for $t_{extrel}lltll{t}_{extcoal}$, $(t{P}_t{)}^{-1}$ is approximately the probability that two random walks never meet before time $t$, and also $|V|/(2t_{extmeet})$. In addition, we define a natural uniform transience condition, and show that it implies the above for all $1lltll{t}_{extcoal}$. Such estimates of $t{P}_t$ are also obtained for all infinite transient transitive unimodular graphs, in particular, all transient transitive amenable graphs.

Recommendations

• Mean field conditions for coalescing random walks
• On the coalescence time of reversible random walks
• Large void zones and occupation times for coalescing random walks
• Coalescent random walks on graphs
• On coalescence time in graphs: when is coalescing as fast as meeting? Extended abstract

Cites work

• A finitary structure theorem for vertex-transitive graphs of polynomial growth
• A limit theorem for patch sizes in a selectively-neutral migration model
• A spectral characterization for concentration of the cover time
• Asymptotic density in a coalescing random walk model.
• Asymptotics for interacting particle systems onZ d
• Coalescing random walk on unimodular graphs
• Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\)
• Coalescing random walks and voting on connected graphs
• scientific article; zbMATH DE number 1069282 (Why is no real title available?)
• scientific article; zbMATH DE number 1867202 (Why is no real title available?)
• scientific article; zbMATH DE number 790938 (Why is no real title available?)
• Inequalities for rare events in time-reversible Markov chains. I.
• Limiting point processes for rescalings of coalescing and annihilating random walks on \(Z^ n\).
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Mean field conditions for coalescing random walks
• On coalescence time in graphs: when is coalescing as fast as meeting? Extended abstract
• On the coalescence time of reversible random walks
• Probability on trees and networks
• Random graphs and complex networks. Volume 1
• Recent progress in coalescent theory.
• Site recurrence for coalescing random walk
• Some inequalities for reversible Markov chains and branching random walks via spectral optimization
• The social network model on infinite graphs

Cited in

(9)

• Large void zones and occupation times for coalescing random walks
• Mean field conditions for coalescing random walks
• Discordant edges for the voter model on regular random graphs
• Meeting, coalescence and consensus time on random directed graphs
• Sharp asymptotics for N-point correlation functions of coalescing heavy-tailed random walks
• Coalescence on the discrete torus revisited
• Diffusion-limited annihilating-coalescing systems
• Evolution of discordant edges in the voter model on random sparse digraphs
• Dissipative particle systems on expanders

This page was built for publication: Mean field behavior during the big bang regime for coalescing random walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2085541)