Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
121 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 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

Right-Most Position of a Last Progeny Modified Time Inhomogeneous Branching Random Walk (2110.04532v1)

Published 9 Oct 2021 in math.PR

Abstract: In this work, we consider a modification of time \emph{inhomogeneous} branching random walk, where the driving increment distribution changes over time macroscopically. Following Bandyopadhyay and Ghosh (2021), we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the last generation. We call this process \emph{last progeny modified time inhomogeneous branching random walk (LPMTI-BRW)}. Under very minimal assumptions on the underlying point processes of the displacements, we show that the maximum displacement converges to a limit after only an appropriate centering which is either linear or linear with a logarithmic correction. Interestingly, the limiting distribution depends only on the first set of increments. We also derive Brunet-Derrida-type results of point process convergence of our LPMTI-BRW to a decorated Poisson point process. As in the case of the maximum, the limiting point process also depends only on the first set of increments. Our proofs are based on the method of coupling the maximum displacement with the smoothing transformation, which was introduced by Bandyopadhyay and Ghosh (2021).

Summary

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