How big is the minimum of a branching random walk?

From MaRDI portal
Publication:5963217




Abstract: Let Mn be the minimal position at generation n, of a real-valued branching random walk in the boundary case. As noinfty, Mn3over2logn is tight (see [1][9][2]). We establish here a law of iterated logarithm for the upper limits of Mn: upon the system's non-extinction, limsupnoinfty1overlogloglogn(Mn3over2logn)=1 almost surely. We also study the problem of moderate deviations of Mn: p(Mn3over2logn>lambda) for lambdaoinfty and lambda=o(logn). This problem is closely related to the small deviations of a class of Mandelbrot's cascades.









This page was built for publication: How big is the minimum of a branching random walk?

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