Papers
Topics
Authors
Recent
Search
2000 character limit reached

Tightness for branching random walk in time-inhomogeneous random environment

Published 23 May 2022 in math.PR | (2205.11643v3)

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

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.