ترغب بنشر مسار تعليمي؟ اضغط هنا

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

65   0   0.0 ( 0 )
 نشر من قبل Antar Bandyopadhyay
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

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, when $theta$ takes a particular value $theta_0$, 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. We also characterize the limiting distribution. We further show that below the boundary (that is, when $theta < theta_0$), the logarithmic correction term is absent. For above the boundary case (that is, when $theta > theta_0$), we have only a partial result, which indicates a possible existence of the logarithmic correction in the centering with exactly the same constant 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 decorated Poisson point process. Our proofs are based on a novel method of coupling the maximum displacement with a linear statistics associated with a more well-studied process in statistics, known as the smoothing transformation.



قيم البحث

اقرأ أيضاً

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 dri ving increment distribution. This model was first introduced by Bandyopadhyay and Ghosh (2021) and they termed it as Last Progeny Modified Branching Random Walk (LPM-BRW). Under very minimal assumptions, we derive the large deviation principle (LDP) for the right-most position of a particle in generation $n$. As a byproduct, we also complete the LDP for the classical model, which complements the earlier work by Gantert and H{o}felsauer (2018).
In this paper we consider a d-dimensional scenery seen along a simple symmetric branching random walk, where at each time each particle gives the color record it is seeing. We show that we can a.s. reconstruct the scenery up to equivalence from the c olor record of all the particles. For this we assume that the scenery has at least 2d + 1 colors which are i.i.d. with uniform probability. This is an improvement in comparison to [22] where the particles needed to see at each time a window around their current position. In [11] the reconstruction is done for d = 2 with only one particle instead of a branching random walk, but millions of colors are necessary.
We work under the A{i}d{e}kon-Chen conditions which ensure that the derivative martingale in a supercritical branching random walk on the line converges almost surely to a nondegenerate nonnegative random variable that we denote by $Z$. It is shown t hat $mathbb{E} Zmathbf{1}_{{Zle x}}=log x+o(log x)$ as $xtoinfty$. Also, we provide necessary and sufficient conditions under which $mathbb{E} Zmathbf{1}_{{Zle x}}=log x+{rm const}+o(1)$ as $xtoinfty$. This more precise asymptotics is a key tool for proving distributional limit theorems which quantify the rate of convergence of the derivative martingale to its limit $Z$. The methodological novelty of the present paper is a three terms representation of a subharmonic function of at most linear growth for a killed centered random walk of finite variance. This yields the aforementioned asymptotics and should also be applicable to other models.
In this article, we consider a Branching Random Walk (BRW) on the real line where the underlying genealogical structure is given through a supercritical branching process in i.i.d. environment and satisfies Kesten-Stigum condition. The displacements coming from the same parent are assumed to have jointly regularly varying tails. Conditioned on the survival of the underlying genealogical tree, we prove that the appropriately normalized (depends on the expected size of the $n$-th generation given the environment) maximum among positions at the $n$-th generation converges weakly to a scale-mixture of Frech{e}t random variable. Furthermore, we derive the weak limit of the extremal processes composed of appropriately scaled positions at the $n$-th generation and show that the limit point process is a member of the randomly scaled scale-decorated Poisson point processes (SScDPPP). Hence, an analog of the predictions by Brunet and Derrida (2011) holds.
We study the one-dimensional branching random walk in the case when the step size distribution has a stretched exponential tail, and, in particular, no finite exponential moments. The tail of the step size $X$ decays as $mathbb{P}[X geq t] sim a exp( -lambda t^r)$ for some constants $a, lambda > 0$ where $r in (0,1)$. We give a detailed description of the asymptotic behaviour of the position of the rightmost particle, proving almost-sure limit theorems, convergence in law and some integral tests. The limit theorems reveal interesting differences betweens the two regimes $ r in (0, 2/3)$ and $ r in (2/3, 1)$, with yet different limits in the boundary case $r = 2/3$.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا