The maximal displacement of radially symmetric branching random walk in Rd
Abstract
We consider discrete-time branching random walks with a radially symmetric distribution. Independently of each other individuals generate offspring whose relative locations are given by a copy of a radially symmetric point process L. The number of particles at time t form a supercritical Galton-Watson process. We investigate the maximal distance to the origin of such branching random walks. Conditioned on survival, we show that, under some assumptions on L, it grows in the same way as for branching Brownian motion or a broad class of one-dimensional branching random walks: the first term is linear in time and the second logarithmic. The constants in front of these terms are explicit and depend only on the mean measure of L and dimension. Our main tool in the proof is a ballot theorem with moving barrier which may be of independent interest.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.