Papers
Topics
Authors
Recent
Search
2000 character limit reached

Capacity of the range of branching random walks in low dimensions

Published 24 Apr 2021 in math.PR | (2104.11898v2)

Abstract: Consider a branching random walk $(V_u)_{u\in \mathcal T{IGW}}$ in $\mathbb Zd$ 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 Zd$ 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$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.