Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Tightness for branching random walk in time-inhomogeneous random environment (2205.11643v2)

Published 23 May 2022 in math.PR

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

We haven't generated a summary for this paper yet.