Papers
Topics
Authors
Recent
Search
2000 character limit reached

Right-Most Position of a Last Progeny Modified Branching Random Walk

Published 5 Jun 2021 in math.PR | (2106.02880v4)

Abstract: In this work, we consider a modification of the usual Branching Random Walk (BRW), where we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the $n$-th generation, which may be different from the driving increment distribution. We call this process last progeny modified branching random walk (LPM-BRW). Depending on the value of a parameter, $\theta$, we classify the model in three distinct cases, namely, the boundary case, below the boundary case, and above the boundary case. Under very minimal assumptions on the underlying point process of the increments, we show that at the boundary case, $\theta=\theta_0$, where $\theta_0$ is a parameter value associated with the displacement point process, the maximum displacement converges to a limit after only an appropriate centering, which is of the form $c_1 n - c_2 \log n$. We give an explicit formula for the constants $c_1$ and $c_2$ and show that $c_1$ is exactly the same, while $c_2$ is $1/3$ of the corresponding constants of the usual BRW Aidekon (2013). We also characterize the limiting distribution. We further show that below the boundary, $\theta < \theta_0$, the logarithmic correction term is absent. For above the boundary case, $\theta > \theta_0$, the logarithmic correction term is exactly the same as that of the classical BRW. For $\theta \leq \theta_0$, we further derive Brunet-Derrida -type results of point process convergence of our LPM-BRW to a Poisson point process. Our proofs are based on a novel method of coupling the maximum displacement with a linear statistic associated with a more well-studied process in statistics, known as the smoothing transformation.

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.

Collections

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