On the maximal displacement of critical branching random walk in random environment
Abstract
In this article, we study the maximal displacement of critical branching random walk in random environment. Let Mn be the maximal displacement of a particle in generation n, and Zn be the total population in generation n, M be the rightmost point ever reached by the branching random walk. Under some reasonable conditions, we prove a conditional limit theorem, equation* L( Mnσ n34 |Zn>0) L(A), equation* where random variable A is related to the standard Brownian meander. And there exist some positive constant C1 and C2, such that equation* C1≤slantx→∞x23(M>x) ≤slant x→∞ x23(M>x) ≤slant C2. equation* Compared with the constant environment case (Lalley and Shao (2015)), it revaels that, the conditional limit speed for Mn in random environment (i.e., n34) is significantly greater than that of constant environment case (i.e., n12), and so is the tail probability for the M (i.e., x-23 vs x-2). Our method is based on the path large deviation for the reduced critical branching random walk in random environment.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.