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

From MaRDI portal
(Redirected from Publication:653802)




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.




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)