Skip to content
Preprint

Asymptotic behaviours of critical branching random walk in $\mathbb{R}^d$

Jul 2026 · 0 citations · 21 references
Mathematics

Abstract

In this paper, we study the asymptotic behaviours of a critical branching random walk in $\mathbb{R}^d$ under the assumption that the offspring distribution belongs to the domain of attraction of an $\alpha$-stable law with $\alpha\in(1,2]$, and that the jump distribution has a finite $\frac{2\alpha}{\alpha-1}$-th moment. First, we establish the precise decay rate for the tail probability of the all-time maximal displacement $M^d$. Next, we investigate the maximal displacement $M_n^d$ at generation $n$ and prove a conditional limit theorem for the distribution of $M_n^d$ given that the process survives up to generation $n$. These results extend the corresponding 1-dimensional results of Lalley and Shao (2015) to the case $d\ge2$. Finally, we study the asymptotic behaviour of the total progeny $\zeta$. In particular, we show that, conditioned on the event $\{M^d\ge x\}$, $\zeta$ converges in distribution under an appropriate normalization. This result reveals a quantitative relationship between the maximal displacement and the total progeny size.

View source

Similar papers

Preprint Jul 2026

Stretched exponential asymptotics for bases of triangular bootstrap percolation

In this paper, we study a bootstrap percolation process on the finite triangular grid $\mathfrak{T}_n$ of side length $n$. We say that a subset $\eta$ of points in $\mathfrak{T}_n$ percolates if the final configuration, starting from $\eta$, is the whole grid $\mathfrak{T}_n$. A basis of size $n$ is then a subset of po...

A. Price, Juliette Schabanel, Paul Th'evenin · 1 citation
Preprint Aug 2026

Cluster-Cluster model in $\mathbb{Z}^d$

We consider a stochastic process on $\mathbb{Z}^d$ for $d \geq 1$. Given a translation invariant and ergodic starting configuration of finite clusters, each cluster $C$ performs a continuous time simple random walk with rate $|C|^{-\alpha}$. If it attempts to move to a vertex occupied by another cluster, it does not mo...

Noam Berger, Eviatar B. Procaccia, Dominik Schmid et al. · 0 citations
Preprint Aug 2026

Rainbow percolation

We consider the weight-dependent random connection model on a Poisson point process of intensity $\lambda$ on $\mathbb{R}\times(0,1)$ in which the vertices $(x,t)$ and $(y,s)$ are joined precisely when $(t\vee s)|x-y|\le\beta$. Points at distance $d$ are joined with probability $\min(1,\beta/d)^2$, the critical decay o...

Peter Gracar, Benjamin Lees · 0 citations
Preprint Jul 2026

Phase transition for the asymptotic entropy of branching random walks on groups

We consider supercritical branching random walks (BRW) on countable groups $G$ and we prove that the asymptotic entropy of the empirical distributions of the BRW has a phase transition at $\rho_* = e^{h(\mu)}$, where $h(\mu)$ is the asymptotic entropy of the underlying random walk on $G$ with step distribution $\mu$. B...

Jérémie Brieussel, R. Kaiser, Martin Klötzer et al. · 0 citations
Preprint Aug 2026

The Heavy-tailed Frog Model

We study the frog model on $\mathbb Z^d$ and on the discrete tori $\mathbb T_L^d$, $d\ge 2$, with a symmetric, translation-invariant, and heavy-tailed transition kernel satisfying \[ Q(x,y)\asymp |x-y|^{-(d+\alpha)}, \qquad \alpha>0. \] Starting from an i.i.d. Poisson$(\lambda)$ number of sleeping particles per site an...

Omer Angel, J. Hermon, Yuliang Shi · 1 citation
Preprint Aug 2026

A Direct Route to Markov Chain Convergence via Asymptotic Equivalence with the Target

For a Markov kernel $T$ with an invariant probability measure $\pi$, we give a self-contained proof of the Markov chain convergence theorem via a criterion called asymptotic equivalence with the target. It assumes two parts about the Lebesgue decompositions of $T^n_x$ and $\pi$ for every starting point $x$: 1.) asympto...

Patrick Forré · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.