Yaglom theorem for critical branching random walk on $\mathbb{Z}^d$
Xinxin Chen, Shen Lin
TL;DR
This paper analyzes the occupation time of a critical branching random walk on $\mathbb{Z}^d$ started far from a compact set and conditioned to hit it. It establishes dimension-dependent asymptotics: $\|x\|^{4-d}$ for $d\le3$, $\log\|x\|$ at $d=4$, and $1$ for $d\ge5$, along with corresponding limit laws. The authors develop distinct techniques across dimensions: spinal decomposition for high $d$, a spatial reduced-tree framework at the critical dimension, and Brownian-snake/ISE connections in low dimensions, providing a discrete analogue to Le Gall and Merle’s results. They prove Yaglom-type limits, identify the most recent common ancestor structure, and quantify convergence via Wasserstein distances, highlighting deep links between branching capacity, hitting probabilities, and continuum scaling limits. The work advances understanding of occupation-time phenomena in CBRW and offers tools for studying related branching-interacting spatial processes.
Abstract
We study the critical branching random walk on $\mathbb{Z}^d$ started from a distant point $x$ and conditioned to hit some compact set $K$ in $\mathbb{Z}^d$. We are interested in the occupation time in $K$ and present its asymptotic behaviors in different dimensions. It is shown in this work that the occupation time is of order $\|x\|^{4-d}$ in dimensions $d\leq 3$, of order $\log\|x\|$ in dimension $d=4$, and of order 1 in dimensions $d\geq 5$. The corresponding weak convergences are also established. These results answer a question raised by Le Gall and Merle (Elect. Comm. in Probab. 11 (2006), 252-265).
