English

Tightness for branching random walk in time-inhomogeneous random environment

Probability 2025-05-20 v3

Abstract

We consider a branching random walk in time-inhomogeneous random environment, in which all particles at generation kk branch into the same random number of particles Lk+12\mathcal{L}_{k+1}\ge 2, where the Lk\mathcal{L}_k, kNk\in\mathbb{N}, are i.i.d., and the increments are standard normal. Let P\mathbb{P} denote the law of (Lk)kN(\mathcal{L}_k)_{k\in\mathbb{N}}, and let MnM_n denote the position of the maximal particle in generation nn. We prove that there are mnm_n, which are functions of only (Lk)k{0,,n}(\mathcal{L}_k)_{k\in\{0,\dots, n\}}, such that (with regard to P\mathbb{P}) the sequence (Mnmn)nN(M_n-m_n)_{n\in\mathbb{N}} is tight with high probability.

Keywords

Cite

@article{arxiv.2205.11643,
  title  = {Tightness for branching random walk in time-inhomogeneous random environment},
  author = {Xaver Kriechbaum},
  journal= {arXiv preprint arXiv:2205.11643},
  year   = {2025}
}

Comments

58 pages, 5 figures, fixed typos, slightly more general formulation of the results in Section 8 for use in future work

R2 v1 2026-06-24T11:26:17.873Z