Asymptotics of randomly stopped sums in the presence of heavy tails
Denis Denisov, Sergey Foss, Dmitry Korshunov

TL;DR
This paper investigates the asymptotic behavior of randomly stopped sums with heavy-tailed distributions, providing new conditions and bounds that extend classical results and are particularly relevant for branching processes.
Contribution
It establishes new asymptotic equivalences for heavy-tailed sums and maxima, including cases with heavy-tailed stopping times, and improves existing bounds for subexponential distributions.
Findings
Asymptotic equivalence of tail probabilities for sums and maxima with heavy tails.
New asymptotics involving the tail of the stopping time in branching processes.
Enhanced uniform bounds for tail ratios in subexponential distributions.
Abstract
We study conditions under which as , where is a sum of random size and is a maximum of partial sums . Here , , 2, ..., are independent identically distributed random variables whose common distribution is assumed to be subexponential. We consider mostly the case where is independent of the summands; also, in a particular situation, we deal with a stopping time. Also we consider the case where and where the tail of is comparable with or heavier than that of , and obtain the asymptotics as . This case is of a primary interest in the branching processes. In addition, we obtain new uniform (in all and ) upper bounds for the ratio…
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.
Taxonomy
TopicsStochastic processes and statistical mechanics · Probability and Risk Models · Markov Chains and Monte Carlo Methods
