


























Abstract:We study $\lambda$-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 $\lambda$-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$.
From: David Geldbach [view email]
[v1]
Tue, 11 Feb 2025 08:34:11 UTC (223 KB)
[v2]
Fri, 27 Feb 2026 10:48:14 UTC (226 KB)
[v3]
Sun, 28 Jun 2026 11:48:13 UTC (214 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。