English

Consistent Minimal Displacement of Branching Random Walks

Probability 2009-12-09 v1

Abstract

Let T\mathbb{T} denote a rooted bb-ary tree and let {Sv}vT\{S_v\}_{v\in \mathbb{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 Λ()\Lambda(\cdot). Let mnm_n denote the minimum of the variables SvS_v over all vertices at the nnth generation, denoted by Dn\mathbb{D}_n. Under mild conditions, mn/nm_n/n converges almost surely to a constant, which for convenience may be taken to be 0. With \bar S_v=\max\{S_w:{\rm wisonthegeodesicconnectingtherootto is on the geodesic connecting the root to v}\}, define Ln=minvDnSˉvL_n=\min_{v\in \mathbb{D}_n} \bar S_v. We prove that Ln/n1/3L_n/n^{1/3} converges almost surely to an explicit constant l0l_0. This answers a question of Hu and Shi.

Keywords

Cite

@article{arxiv.0912.1392,
  title  = {Consistent Minimal Displacement of Branching Random Walks},
  author = {Ming Fang and Ofer Zeitouni},
  journal= {arXiv preprint arXiv:0912.1392},
  year   = {2009}
}
R2 v1 2026-06-21T14:20:48.548Z