Biased branching random walks on Bienaymé--Galton--Watson trees

Abstract

We study $λ$-biased branching random walks on Bienaymé--Galton--Watson trees in discrete time. We consider the maximal displacement at time $n$, $\max_{\vert u \vert =n} \vert X(u) \vert$, and show that it almost surely grows at a deterministic, linear speed. We characterize this speed with the help of the large deviation rate function of the $λ$-biased random walk of a single particle. A similar result is given for the minimal displacement at time $n$, $\min_{\vert u \vert =n} \vert X(u) \vert$.