arXiv Analytics

Sign in

arXiv:1305.6201 [math.PR]AbstractReferencesReviewsResources

Maximal displacement in a branching random walk through interfaces

Bastien Mallein

Published 2013-05-27, updated 2015-06-24Version 2

In this article, we study a branching random walk in an environment which depends on the time. This time-inhomogeneous environment consists of a sequence of macroscopic time intervals, in each of which the law of reproduction remains constant. We prove that the asymptotic behaviour of the maximal displacement in this process consists of a first ballistic order, given by the solution of an optimization problem under constraints, a negative logarithmic correction, plus stochastically bounded fluctuations.

Comments: 42 pages, 7 figures, published in EJP
Journal: Electron. J. Probab. 20 (2015), no. 68, 1--40
Categories: math.PR
Subjects: 60J80, 60G50
Related articles: Most relevant | Search more
arXiv:1809.04245 [math.PR] (Published 2018-09-12)
Limit theorems for the minimal position of a branching random walk in random environment
arXiv:0912.1392 [math.PR] (Published 2009-12-08)
Consistent Minimal Displacement of Branching Random Walks
arXiv:1307.4496 [math.PR] (Published 2013-07-17, updated 2015-05-19)
Maximal displacement of a branching random walk in time-inhomogeneous environment