Answers are grounded in this paper and cite their sources.
This paper describes how critical branching processes relate to random walks and stable laws in random environments, revealing new asymptotic behaviors.
Let { Z n , n = 0, 1, 2, …} be a critical branching process in a random environment, and { S n , n = 0, 1, 2, …} be its associated random walk. It is known that if the increments of this random walk belong (without centering) to the domain of attraction of a stable law, then there exists a regularly varying at infinity sequence a 1 , a 2 , … such that conditional distributions <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="block"> <m:mtable rowspacing="4pt" columnspacing="1em"> <m:mtr> <m:mtd> <m:mstyle displaystyle="true"> <m:mrow class="MJX-TeXAtom-ORD"> <m:mi mathvariant="bold">P</m:mi> </m:mrow> <m:mrow class="MJX-TeXAtom-ORD"> <m:mo maxsize="2.047em" minsize="2.047em">(</m:mo> </m:mrow> <m:mfrac> <m:msub> <m:mi>S</m:mi> <m:mrow class="MJX-TeXAtom-ORD"> <m:mi>n</m:mi> </m:mrow> </m:msub> <m:msub> <m:mi>a</m:mi> <m:mrow class="MJX-TeXAtom-ORD"> <m:mi>n</m:mi> </m:mrow> </m:msub> </m:mfrac> <m:mo>≤</m:mo> <m:mi>x</m:mi> <m:mrow class="MJX-TeXAtom-REL"> <m:mo maxsize="1.623em" minsize="1.623em">|</m:mo> </m:mrow> <m:msub> <m:mi>Z</m:mi> <m:mrow class="MJX-TeXAtom-ORD"> <m:mi>n</m:mi> </m:mrow> </m:msub> <m:mo>></m:mo> <m:mn>0</m:mn> <m:mrow class="MJX-TeXAtom-ORD"> <m:mo maxsize="2.047em" minsize="2.047em">)</m:mo> </m:mrow> <m:mo>,</m:mo> <m:mspace width="1em"/> <m:mi>x</m:mi> <m:mo>∈</m:mo> <m:mo stretchy="false">(</m:mo> <m:mo>−</m:mo> <m:mi mathvariant="normal">∞</m:mi> <m:mo>,</m:mo> <m:mo>+</m:mo> <m:mi mathvariant="normal">∞</m:mi> <m:mo stretchy="false">)</m:mo> <m:mo>,</m:mo> </m:mstyle> </m:mtd> </m:mtr> </m:mtable> </m:math> array P(Sₙaₙ≤ x| Zₙ > 0), x∈(-∞,+∞), array converge weakly to the distribution of strictly positive proper random variable. In this paper we add to this result the description of the asymptotic behavior of the probability <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" display="block"> <m:mtable rowspacing="4pt" columnspacing="1em"> <m:mtr> <m:mtd> <m:mstyle displaystyle="true"> <m:mrow class="MJX-TeXAtom-ORD"> <m:mi mathvariant="bold">P</m:mi> </m:mrow> <m:mo stretchy="false">(</m:mo> <m:msub> <m:mi>Z</m:mi> <m:mrow class="MJX-TeXAtom-ORD"> <m:mi>n</m:mi> </m:mrow> </m:msub> <m:mo>></m:mo> <m:mn>0</m:mn> <m:mo>,</m:mo> <m:msub> <m:mi>S</m:mi> <m:mrow class="MJX-TeXAtom-ORD"> <m:mi>n</m:mi> </m:mrow> </m:msub> <m:mo>≤</m:mo> <m:mi>φ</m:mi> <m:mo stretchy="false">(</m:mo> <m:mi>n</m:mi> <m:mo stretchy="false">)</m:mo> <m:mo stretchy="false">)</m:mo> <m:mo>,</m:mo> </m:mstyle> </m:mtd> </m:mtr> </m:mtable> </m:math> array P(Zₙ > 0, Sₙ≤ φ(n)), array where φ ( n ) → ∞ for n → ∞ in such a way that φ ( n ) = o ( a n ).
No takes yet. Share an insight, caveat, or question.
Vatutin et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: