Consistent Minimal Displacement of Branching Random Walks
Probability
2009-12-09 v1
Abstract
Let denote a rooted -ary tree and let 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 denote the minimum of the variables over all vertices at the th generation, denoted by . Under mild conditions, converges almost surely to a constant, which for convenience may be taken to be 0. With \bar S_v=\max\{S_w:{\rm wv}\}, define . We prove that converges almost surely to an explicit constant . This answers a question of Hu and Shi.
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}
}