2000 character limit reached
Convergence in law for the capacity of the range of a critical branching random walk
Published 7 Mar 2022 in math.PR | (2203.03188v2)
Abstract: Let $R_n$ be the range of a critical branching random walk with $n$ particles on $\mathbb Zd$, which is the set of sites visited by a random walk indexed by a critical Galton--Watson tree conditioned on having exactly $n$ vertices. For $d\in{3, 4, 5}$, we prove that $n{-\frac{d-2}4} \mathtt{cap}{(d)}(R_n)$, the renormalized capacity of $R_n$, converges in law to the capacity of the support of the integrated super-Brownian excursion. The proof relies on a study of the intersection probabilities between the critical branching random walk and an independent simple random walk on $\mathbb Zd$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.