arXiv Analytics

Sign in

arXiv:2104.11898 [math.PR]AbstractReferencesReviewsResources

Capacity of the range of branching random walks in low dimensions

Tianyi Bai, Yueyun Hu

Published 2021-04-24Version 1

Consider a branching random walk $(V_u)_{u\in \mathcal T^{IGW}}$ in $\mathbb Z^d$ with the genealogy tree $\mathcal T^{IGW}$ formed by a sequence of i.i.d. critical Galton-Watson trees. Let $R_n $ be the set of points in $\mathbb Z^d$ visited by $(V_u)$ when the index $u$ explores the first $n$ subtrees in $\mathcal T^{IGW}$. Our main result states that for $d\in \{3, 4, 5\}$, the capacity of $R_n$ is almost surely equal to $n^{\frac{d-2}{2}+o(1)}$ as $n \to \infty$.

Related articles: Most relevant | Search more
arXiv:math/9803100 [math.PR] (Published 1998-03-23)
A Simple Path to Biggins' Martingale Convergence for Branching Random Walk
arXiv:1901.09623 [math.PR] (Published 2019-01-28)
Branching Random Walks and their Applications for Epidemic Modelling
arXiv:0911.2227 [math.PR] (Published 2009-11-11)
The critical random barrier for the survival of branching random walk with absorption