首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Total progeny in killed branching random walk
Authors:L Addario-Berry  N Broutin
Institution:1. Department of Mathematics and Statistics, McGill University, Montreal, Canada
2. Projet?algorithms, INRIA Rocquencourt, 78153, Le Chesnay, France
Abstract:We consider a branching random walk for which the maximum position of a particle in the n??th generation, R n , has zero speed on the linear scale: R n /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?C814, 2006; Hu and Shi in Ann. Probab. 37(2):742?C789, 2009). In this paper, we confirm a conjecture of Aldous (Algorithmica 22:388?C412, 1998; and Power laws and killed branching random walks) that E Z]?<??? while ${{\mathbf E}\leftZ\,{\rm log}\, Z\right]=\infty}$ . The proofs rely on precise large deviations estimates and ballot theorem-style results for the sample paths of random walks.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号