2021
DOI: 10.1016/j.spl.2020.108918
|View full text |Cite
|
Sign up to set email alerts
|

Bounds for convergence rate in laws of large numbers for mixed Poisson random sums

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 28 publications
0
1
0
Order By: Relevance
“…Specifically, for a = 1, the fact that the limiting distribution of rv Y is Exp(1) represents a classic theorem due to Rényi [11], see also [12]. A generalization of Rényi's theorem to negative binomial distributions NB(r, p) of the second kind with arbitrary r > 0 was obtained by Korolev and Zeifman [13] based on an estimate of the Zolotarev distance [14] between the distributions of the normalized random sum U and E(r, r); for a review of relevant results and methodology, see the article by Korolev [9] and references therein. Although it is probably possible to prove Theorem 1 by reduction to the known limit theorems for the normalized random sum U, we here prefer, for greater insight and the reader's convenience, to give a direct, self-contained, and fairly elementary proof of Theorem 1.…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, for a = 1, the fact that the limiting distribution of rv Y is Exp(1) represents a classic theorem due to Rényi [11], see also [12]. A generalization of Rényi's theorem to negative binomial distributions NB(r, p) of the second kind with arbitrary r > 0 was obtained by Korolev and Zeifman [13] based on an estimate of the Zolotarev distance [14] between the distributions of the normalized random sum U and E(r, r); for a review of relevant results and methodology, see the article by Korolev [9] and references therein. Although it is probably possible to prove Theorem 1 by reduction to the known limit theorems for the normalized random sum U, we here prefer, for greater insight and the reader's convenience, to give a direct, self-contained, and fairly elementary proof of Theorem 1.…”
Section: Introductionmentioning
confidence: 99%