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

E.F. Aidekon, Z. Shi

Research output: Contribution to journalArticleAcademicpeer-review

20 Citations (Scopus)
1 Downloads (Pure)

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 log n when n ¿ 8. 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.
Original languageEnglish
Pages (from-to)43-54
JournalPeriodica Mathematica Hungarica
Volume61
Issue number1-2
DOIs
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'Weak convergence for the minimal position in a branching random walk: A simple proof'. Together they form a unique fingerprint.

Cite this