Tightness for branching random walk in time-inhomogeneous random environment
Xaver Kriechbaum

TL;DR
This paper studies a branching random walk in a time-inhomogeneous environment with random branching, proving that the maximum particle position, after suitable centering, remains tightly bounded with high probability.
Contribution
It establishes tightness results for the maximum particle position in a branching random walk with i.i.d. random branching factors and Gaussian increments, in a time-inhomogeneous setting.
Findings
The maximum particle position, after centering, is tight with high probability.
The centering functions depend only on the branching factors up to current generation.
The model extends classical branching random walk results to a random environment setting.
Abstract
We consider a branching random walk in time-inhomogeneous random environment, in which all particles at generation branch into the same random number of particles , where the , , are i.i.d., and the increments are standard normal. Let denote the law of , and let denote the position of the maximal particle in generation . We prove that there are , which are functions of only , such that (with regard to ) the sequence is tight with high probability.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Mathematical Dynamics and Fractals · Data Management and Algorithms
