<p>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 <i>n</i>-th generation, which may be different from the driving increment distribution. We call this process <i>last progeny modified branching random walk (LPM-BRW)</i>. Depending on the value of a parameter, <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq1.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="13" /> </InlineMediaObject> <EquationSource Format="TEX">\(\theta \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>θ</mi> </math></EquationSource> </InlineEquation>, we classify the model into 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 <i>boundary case</i>, <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(\theta =\theta _0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>θ</mi> <mo>=</mo> <msub> <mi>θ</mi> <mn>0</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq3.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(\theta _0\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>θ</mi> <mn>0</mn> </msub> </math></EquationSource> </InlineEquation> 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 <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq4.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="98" /> </InlineMediaObject> <EquationSource Format="TEX">\(c_1 n - c_2 \log n\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>c</mi> <mn>1</mn> </msub> <mi>n</mi> <mo>-</mo> <msub> <mi>c</mi> <mn>2</mn> </msub> <mo>log</mo> <mi>n</mi> </mrow> </math></EquationSource> </InlineEquation>. We give an explicit formula for the constants <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq5.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(c_1\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>c</mi> <mn>1</mn> </msub> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq6.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(c_2\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>c</mi> <mn>2</mn> </msub> </math></EquationSource> </InlineEquation> and show that <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq5.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(c_1\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>c</mi> <mn>1</mn> </msub> </math></EquationSource> </InlineEquation> is exactly the same, while <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq6.gif" Format="GIF" Height="12" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(c_2\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>c</mi> <mn>2</mn> </msub> </math></EquationSource> </InlineEquation> is 1/3 of the corresponding constants of the usual BRW&#xa0;[<CitationRef CitationID="CR2">2</CitationRef>]. We also characterize the limiting distribution. We further show that below the boundary, <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq9.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(\theta &lt; \theta _0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>θ</mi> <mo>&lt;</mo> <msub> <mi>θ</mi> <mn>0</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>, the logarithmic correction term is absent. For above the boundary, <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq10.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="46" /> </InlineMediaObject> <EquationSource Format="TEX">\(\theta &gt; \theta _0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>θ</mi> <mo>&gt;</mo> <msub> <mi>θ</mi> <mn>0</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>, the logarithmic correction term is exactly the same as that of the classical BRW. For <InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10959_2025_1404_Article_IEq11.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">\(\theta \le \theta _0\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>θ</mi> <mo>≤</mo> <msub> <mi>θ</mi> <mn>0</mn> </msub> </mrow> </math></EquationSource> </InlineEquation>, 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 <i>linear statistic</i> associated with a more well-studied process in statistics, known as the <i>smoothing transformation</i>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

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

  • Antar Bandyopadhyay,
  • Partha Pratim Ghosh

摘要

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 into 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\) θ = θ 0 , where \(\theta _0\) θ 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\) c 1 n - c 2 log n . We give an explicit formula for the constants \(c_1\) c 1 and \(c_2\) c 2 and show that \(c_1\) c 1 is exactly the same, while \(c_2\) c 2 is 1/3 of the corresponding constants of the usual BRW [2]. We also characterize the limiting distribution. We further show that below the boundary, \(\theta < \theta _0\) θ < θ 0 , the logarithmic correction term is absent. For above the boundary, \(\theta > \theta _0\) θ > θ 0 , the logarithmic correction term is exactly the same as that of the classical BRW. For \(\theta \le \theta _0\) θ θ 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.