Total progeny in killed branching random walk

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We consider a branching random walk for which the maximum position of a particle in the n'th generation, Rn, has zero speed on the linear scale: Rn/n → 0 as n → ∞. We further remove ("kill") any particle whose displacement is negative, together with its entire descendence. The size Z of the set of un-killed particles is almost surely finite (Gantert and Müller in Markov Process. Relat. Fields 12:805-814, 2006; Hu and Shi in Ann. Probab. 37(2):742-789, 2009). In this paper, we confirm a conjecture of Aldous (Algorithmica 22:388-412, 1998; and Power laws and killed branching random walks) that E [Z] < ∞ while E[Z log Z] = ∞. The proofs rely on precise large deviations estimates and ballot theorem-style results for the sample paths of random walks. © 2010 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Addario-Berry, L., & Broutin, N. (2011). Total progeny in killed branching random walk. Probability Theory and Related Fields, 151(1), 265–295. https://doi.org/10.1007/s00440-010-0299-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free