English

On the First Passage Times of Branching Random Walks in $\mathbb R^d$

Probability 2026-01-06 v2

Abstract

We study the first passage times of discrete-time branching random walks in Rd{\mathbb R}^d where d1d\geq 1. Here, the genealogy of the particles follows a supercritical Galton-Watson process. We provide asymptotics of the first passage times to a ball of radius one with a distance xx from the origin, conditioned upon survival. We provide explicitly the linear dominating term and the logarithmic correction term as a function of xx. The asymptotics are precise up to an order of oP(logx)o_{\mathbb P}(\log x) for general jump distributions and up to OP(loglogx)O_{\mathbb P}(\log\log x) for spherically symmetric jumps. A crucial ingredient of both results is the tightness of first passage times. We also discuss an extension of the first passage time analysis to a modified branching random walk model that has been proven to successfully capture shortest path statistics in polymer networks.

Keywords

Cite

@article{arxiv.2404.09064,
  title  = {On the First Passage Times of Branching Random Walks in $\mathbb R^d$},
  author = {Jose Blanchet and Wei Cai and Shaswat Mohanty and Zhenyuan Zhang},
  journal= {arXiv preprint arXiv:2404.09064},
  year   = {2026}
}

Comments

41 pages, 8 figures; to appear in the Annals of Applied Probability