Weak convergence for the minimal position in a branching random walk: a simple proof

From MaRDI portal
Publication:653802

DOI10.1007/S10998-010-3043-XzbMATH Open1240.60227arXiv1006.1266OpenAlexW4299599819MaRDI QIDQ653802FDOQ653802


Authors: Elie Aïdékon, Zhan Shi Edit this on Wikidata


Publication date: 19 December 2011

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Abstract: Consider the boundary case in a one-dimensional super-critical branching random walk. It is known that upon the survival of the system, the minimal position after n steps behaves in probability like 3over2logn when noinfty. We give a simple and self-contained proof of this result, based exclusively on elementary properties of sums of i.i.d. real-valued random variables.


Full work available at URL: https://arxiv.org/abs/1006.1266




Recommendations




Cites Work


Cited In (33)





This page was built for publication: Weak convergence for the minimal position in a branching random walk: a simple proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653802)