Consistent Minimal Displacement of Branching Random Walks
Abstract
Let T denote a rooted b-ary tree and let \Sv\v∈ T denote a branching random walk indexed by the vertices of the tree, where the increments are i.i.d. and possess a logarithmic moment generating function (·). Let mn denote the minimum of the variables Sv over all vertices at the nth generation, denoted by Dn. Under mild conditions, mn/n converges almost surely to a constant, which for convenience may be taken to be 0. With Sv=\Sw: w is on the geodesic connecting the root to v\, define Ln=v∈ Dn Sv. We prove that Ln/n1/3 converges almost surely to an explicit constant l0. This answers a question of Hu and Shi.
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.