Reduced critical branching processes in non-favorable random environment
V.A.Vatutin, E.E.Dyakonova

TL;DR
This paper studies the asymptotic behavior of critical branching processes in random environments, revealing how the logarithm of the process scales and converges to a Brownian meander, including cases with stable law increments.
Contribution
It extends existing results by describing the distribution of scaled logarithms of the process conditioned on survival and explores stable law cases.
Findings
Logarithm of the process converges to a Brownian meander under certain conditions.
Distribution of scaled log-process conditioned on survival is characterized.
Results include cases where increments follow a stable law domain of attraction.
Abstract
Let be a critical branching process in i.i.d. random environment, be the number of particles in the process at moment that have a positive number of descendants in generation , and be the associated random walk of . It is known that if the increments of the associated random walk have zero mean and finite variance then, for any \begin{equation*} \lim_{n\rightarrow \infty }\mathbf{P}\left( \frac{\log Z_{\left[ nt\right] ,n}}{\sigma \sqrt{n}}\leq x\Big|Z_{n}>0\right) =\mathbf{P}\left( \min_{t\leq s\leq 1}B_{s}^{+}\leq x\right) ,\;x\in \lbrack 0,\infty ), \end{equation*} where is the Brownian meander. We supplement this result by description of the distribution of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
