Tightness for branching random walk in time-inhomogeneous random environment
Abstract
We consider a branching random walk in time-inhomogeneous random environment, in which all particles at generation k branch into the same random number of particles Lk+1 2, where the Lk, k∈N, are i.i.d., and the increments are standard normal. Let P denote the law of (Lk)k∈N, and let Mn denote the position of the maximal particle in generation n. We prove that there are mn, which are functions of only (Lk)k∈\0,…, n\, such that (with regard to P) the sequence (Mn-mn)n∈N is tight with high probability.
0
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.