Scaling limit of the path leading to the leftmost particle in a branching random walk
Abstract
We consider a discrete-time branching random walk defined on the real line, which is assumed to be supercritical and in the boundary case. It is known that its leftmost position of the n-th generation behaves asymptotically like 32 n, provided the non-extinction of the system. The main goal of this paper, is to prove that the path from the root to the leftmost particle, after a suitable normalizatoin, converges weakly to a Brownian excursion in D([0,1],).
0
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.