Next Article in Journal
A Multi-Depot Vehicle Routing Problem with Stochastic Road Capacity and Reduced Two-Stage Stochastic Integer Linear Programming Models for Rollout Algorithm
Previous Article in Journal
Local Dynamics of Logistic Equation with Delay and Diffusion
Previous Article in Special Issue
On Approximation of the Tails of the Binomial Distribution with These of the Poisson Law
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Accuracy of the Generalized Gamma Approximation to Generalized Negative Binomial Random Sums

by
Irina Shevtsova
1,2,3,4,* and
Mikhail Tselishchev
2,*
1
Department of Mathematics, School of Science, Hangzhou Dianzi University, Hangzhou 310018, China
2
Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, Lomonosov Moscow State University, 119991 Moscow, Russia
3
Federal Research Center ”Computer Science and Control” of the Russian Academy of Sciences, 119333 Moscow, Russia
4
Moscow Center for Fundamental and Applied Mathematics, 119991 Moscow, Russia
*
Authors to whom correspondence should be addressed.
Mathematics 2021, 9(13), 1571; https://doi.org/10.3390/math9131571
Submission received: 28 May 2021 / Revised: 1 July 2021 / Accepted: 2 July 2021 / Published: 4 July 2021
(This article belongs to the Special Issue Analytical Methods and Convergence in Probability with Applications)

Abstract

:
We investigate the proximity in terms of zeta-structured metrics of generalized negative binomial random sums to generalized gamma distribution with the corresponding parameters, extending thus the zeta-structured estimates of the rate of convergence in the Rényi theorem. In particular, we derive upper bounds for the Kantorovich and the Kolmogorov metrics in the law of large numbers for negative binomial random sums of i.i.d. random variables with nonzero first moments and finite second moments. Our method is based on the representation of the generalized negative binomial distribution with the shape and exponent power parameters no greater than one as a mixed geometric law and the infinite divisibility of the negative binomial distribution.

1. Introduction

Negative binomial and generalized negative binomial random sums naturally arise in various applications, such as meteorology, insurance, and financial mathematics. For example, in [1], it was demonstrated that the generalized negative binomial distribution has an excellent concordance with the empirical distribution of the duration of wet periods measured in days in Potsdam and Elista. Hence, the total precipitation volume per wet period forms a generalized negative binomial random sum. Various applications of geometric random sums, which are particular cases of the generalized negative binomial random sums can be found in [2]. A reasonable approach is to approximate the distributions of such random sums with specific distributions by applying limit theorems. Thus, it is of great practical importance to measure the accuracy of these approximations.
Recall that an r.v. N r , p has the negative binomial distribution with parameters r > 0 and p ( 0 , 1 ) , which is denoted by N r , p NB r , p , if
P ( N r , p = k ) = Γ ( k + r ) k ! Γ ( r ) p r ( 1 p ) k , k = 0 , 1 , 2 , ,
where Γ ( r ) = 0 x r 1 e x d x is the Euler gamma function.
In case of r = 1 , it is reduced to the geometric distribution (starting from zero)— N 1 , p Geom 0 p —that is, N 1 , p has the sense of the number of fails before the first success in the scheme of Bernoulli trials with the success probability p. In the case of natural r, the negative binomial distribution can be represented as an r-fold convolution of the geometric distribution:
N r , p = d M 1 + + M r ,
where M 1 , , M r Geom 0 p are i.i.d. In this case, N r , p has the sense of the total number of fails before the r-th success in the Bernoulli scheme with the success probability p.
The negative binomial is known to be a mixed Poisson distribution with the mixing gamma distribution:
P ( N r , p = k ) = 0 z k k ! e z g z ; r , p 1 p d z , k = 0 , 1 , 2 , ,
where
g ( z ; r , μ ) = μ r z r 1 Γ ( r ) e μ z 𝟙 ( z > 0 ) ,
is the density of the gamma distribution G r , μ with parameters r > 0 and μ > 0 .
A natural idea was to generalize the negative binomial distribution by using generalized gamma GG r , α , μ mixing with the density
g * ( z ; r , α , μ ) = | α | μ r Γ ( r ) z α r 1 e μ z α , z > 0 ,
instead of the ordinary one in Equation (3). The generalized gamma (GG) distribution has an additional parameter α 0 , which plays a role of the exponent power of a gamma-r.v.: if G r , μ G r , μ , then G r , μ 1 / α GG r , α , μ . It was introduced in [3] as a special family of lifetime distributions containing both gamma and Weibull distributions. It also comprises inverse-gamma, half-normal, and some other distributions. A comprehensive list can be found in [4]. The properties of GG distributions are described in [3,5].
A generalization of Gleser’s theorem (see [6], Theorem 3) states that the generalized gamma distribution GG r , α , μ with r ( 0 , 1 ) , α ( 0 , 1 ] and μ > 0 is a mixture of exponential distributions:
g * ( z ; r , α , μ ) = 0 1 y 1 y e y 1 y z · h ( y ; r , α , μ ) d y , z > 0 ,
where (see [4], Remark 3)
h ( y ; r , α , μ ) = μ r Γ ( r ) Γ ( 1 r ) · 1 ( 1 y ) 2 μ + f y ( 1 y ) 1 z 1 / α ; α , 1 ( z μ ) r z 1 + 2 / α d z , y ( 0 , 1 ) ,
is the density of a probability law concentrated on ( 0 , 1 ) , and f ( x ; α , 1 ) is the density of the one-sided strictly stable distribution concentrated on the nonnegative half-line with the characteristic exponent α . The case of α = 1 (which corresponds to the gamma distribution) is covered by the original Gleser’s theorem with the simplified version of the mixing density:
h y ; r , 1 , p 1 p = p r Γ ( r ) Γ ( 1 r ) · ( 1 y ) r 1 y ( y p ) r · 𝟙 { p < y < 1 } .
A r.v. N r , α , μ is said to have the generalized negative binomial (GNB) distribution [4] with parameters r > 0 , α R \ { 0 } and μ > 0 , which is denoted by N r , α , μ GNB r , α , μ , if it has a mixed Poisson distribution with the mixing GG distribution GG r , α , μ :
P ( N r , α , μ = k ) = 0 z k k ! e z g * ( z ; r , α , μ ) d z , k = 0 , 1 , 2 , ,
If α = 1 , then the GNB distribution reduces to the negative binomial one, namely, GNB r , 1 , μ = NB r , μ μ + 1 , or GNB r , 1 , p 1 p = NB r , p for p ( 0 , 1 ) .
Recently, it was discovered in [4], (Theorem 2) that the GNB distribution with r ( 0 , 1 ) , α ( 0 , 1 ] and μ > 0 is a mixed geometric distribution,
P ( N r , α , μ = k ) = 0 1 y ( 1 y ) k · h ( y ; r , α , μ ) d y , k = 0 , 1 , 2 , ,
with the same mixing density h as in Equation (6).
In [4] (Theorem 5), the class of limit distributions for GNB random sums was described; in particular, it was shown that the properly normalized GNB random sum of i.i.d. nonnegative random variables with finite expectations converges to the GG distribution. In the present paper, we will not only extend this result to alternating random summands with nonzero means, but will also construct some estimates of the rate of this convergence. Our reasoning will be essentially based on representation (10), which implies, as we will show in the proof of our Theorem 1 below, that the distribution of the generalized negative binomial random sum of i.i.d. r.v.s is also a mixed geometric random sum and hence allows us to extend some existing estimates in the Rényi theorem to GNB random sums.
Let X 1 , X 2 , be i.i.d. r.v.s with E X 1 0 , S n : = k = 1 n X k , n N , S 0 : = 0 , N p Geom 0 p be independent of { X 1 , X 2 , } , S p : = S N p E S N p = p S N p ( 1 p ) E X 1 , E Exp 1   : = GG ( 1 , 1 , 1 ) . The celebrated Rényi theorem states that if X n 0 a.s. for all n N , then L ( S p ) Exp 1 as p 0 . There exists an extensive literature where the rate of convergence in the Rényi theorem is studied. Let us mention the classic monograph [2], which is devoted specifically to geometric summation, and papers [7,8,9,10,11,12,13]. Monograph [14] also contains an estimate of the rate of convergence of the geometric distribution to the exponential law. The most common are estimates in the Kolmogorov (uniform) metric,
ρ ( X , Y ) ρ L X , L Y   : =   sup x R F ( x ) G ( x )   = sup f F K R f d F R f d G ,
where F ( x ) = P ( X < x ) , G ( x ) = P ( Y < x ) , F K = { 𝟙 ( , a ) ( x ) a R } , and in Zolotarev’s ζ -metrics
ζ s X , Y   ζ s L X , L Y   : = sup f F s R f d F R f d G , s > 0 ,
where
F s   : =   f : R R | f is bounded , | f ( m ) ( x ) f ( m ) ( y ) | | x y | α x , y R ,
s = m + α , m N { 0 } , α ( 0 , 1 ] , which are simple ζ -structured metrics, i.e., can be represented as
ζ F ( X , Y ) ζ F L X , L Y   : = sup f F E f ( X ) E f ( Y ) ,
with specific classes F of real-valued bounded Borel functions on R , namely, ρ = ζ F K , ζ s = ζ F s .
In particular, Brown [7] proved that
ρ ( S p , E ) p E X 1 2 ( E X 1 ) 2 max 1 , 1 2 ( 1 p ) , if X n 0 a . s .
Kalashnikov [2] provides the following bounds for the shifted geometric random sums with E X 1 = 1 :
ζ s p S N p + 1 , E p s 1 ζ s ( X 1 , E ) ,
ζ 1 p S N p + 1 , E p ζ 1 ( X 1 , E ) + 2 ( 1 p ) p s 1 ζ s ( X 1 , E ) ,
for all s ( 1 , 2 ] .
The present authors obtained [13] the following estimate for the Kantorovich ζ 1 distance, extending the one in [11] to the alternating random summands:
ζ 1 ( S p , E ) p 1 p · E X 1 2 ( E X 1 ) 2 .
The aim of the present paper is to extend the ζ -structured estimates of the rate of convergence of geometric random sums to generalized negative binomial random sums for r ( 0 , 1 ) , in particular, to extend bounds (14) and (17) to negative binomial random sums for arbitrary r > 0 .

2. Main Results

Theorem 1.
Let X 1 , X 2 , be a sequence of arbitrary r.v.s, S n   : =   i = 1 n X i for n N , S 0   : =   0 . Let r ( 0 , 1 ) , α ( 0 , 1 ] , μ > 0 , N r , α , μ GNB r , α , μ be independent of { X n } , G r , α , μ * GG r , α , μ and ζ F be a ζ-structured metric w.r.t. some class F or real bounded Borel functions. Then
ζ F S N r , α , μ , G r , α , μ *   0 1 ζ F S N y , 1 y y E   ·   h ( y ; r , α , μ ) d y ,
where N y Geom 0 y is independent of { X n } , E Exp 1 and h ( y ) is given in Equation (7). In particular, if { X n } are i.i.d. square integrable r.v.’s with E X n = 1 ; then, for all r ( 0 , 1 ) , μ > 0 , and α ( 0 , 1 ] , we have
ζ 1 S N r , α , μ , G r , α , μ *   E X 1 2 ,
and if, in addition, all X n 0 a.s., then also
ρ S N r , α , μ , G r , α , μ *   0 1 min 1 y E X 1 2 1 y h ( y ; r , α , μ ) d y ,
ρ S N r , p , G r , p / ( 1 p )   p r ( 2 E X 1 2 + r 1 + 1 ) Γ ( r ) Γ ( 2 r ) , p ( 0 , 1 ) .
Proof. 
To begin with, we prove that the distribution of the random sum S N r , α , μ is a mixture of geometric random sums. Indeed, according to the rule of total probability, representation (10) and Tonelli’s theorem, for any Borel set B R , we have
P S N r , α , μ B = n = 0 P N r , α , μ = n P ( S n B ) = n = 0 0 1 y ( 1 y ) n · h ( y ; r , α , μ ) d y P ( S n B ) = 0 1 n = 0 y ( 1 y ) n P ( S n B ) h ( y ; r , α , μ ) d y = 0 1 P ( S N y B ) · h ( y ; r , α , μ ) d y .
Hence, for any f F ,
E f S N r , α , μ   = 0 1 E f S N y   ·   h ( y ; r , α , μ ) d y .
Similarly, using Equation (6), we obtain
E f G r , α , μ *   = 0 f ( z ) g * ( z ; r , α , μ ) d z = 0 1 E f 1 y y E   ·   h ( y ; r , α , μ ) d y .
Therefore, due to the triangle inequality,
ζ F S N r , α , μ , G r , α , μ *   = sup f F E f ( S N r , α , μ ) E f ( G r , α , μ * )   0 1 ζ F S N y , 1 y y E   ·   h ( y ; r , α , μ ) d y ,
which coincides with (18).
If { X n } are i.i.d. square integrable r.v.s with E X n = 1 , then from (17) and the homogeneity of Kantorovich metric, we have
ζ 1 S N y , 1 y y E   = 1 y y ζ 1 ( S y , E ) E X 1 2 = : α 2 .
Substituting this into (18) and observing that h ( y ; r , α , μ ) integrates to one as a probability density with respect to y, we arrive at (19).
Let us prove (20) and (21). In case of X n 0 a.s., due to (14), we have
ρ S N y , 1 y y E = ρ ( S y , E ) α 2 y 1 y max 1 y , 0.5 , y ( 0 , 1 ) ,
on the one hand. On the other hand, the Kolmogorov metric is always bounded by one, which allows us to write
ρ S N y , 1 y y E   min α 2 y 1 y max 1 y , 0.5 , 1   α 2 y 1 y 1   α 2 y 1 y , y 0.5 , 1 , y > 0.5 .
Substituting this into (18), we obtain
ρ S N r , α , μ , G r , α , μ *   0 1 α 2 y 1 y 1 h ( y ; r , α , μ ) d y .
In particular with α = 1 and μ = p / ( 1 p ) , we have
ρ S N r , p , G r , μ   p r Γ ( r ) Γ ( 1 r ) p 1 α 2 y 1 y 1 ( 1 y ) r 1 y ( y p ) r d y p r ( α 2 I 1 ( p ) + I 2 ( p ) ) Γ ( r ) Γ ( 1 r ) ,
where
I 1 ( p ) = p 0.5 0.5 ( 1 y ) r 2 ( y p ) r d y , I 2 ( p ) = 0.5 p 1 ( 1 y ) r 1 y ( y p ) r d y , p ( 0 , 1 ) .
Changing the variable y = z / ( 1 + z ) we obtain
I 1 ( p ) = p / ( 1 p ) 1 1 d z ( z ( 1 p ) p ) r = ( 1 2 p ) + 1 r ( 1 r ) ( 1 p ) 2 1 r ,
I 2 ( p ) = 1 p 1 p d z z ( z ( 1 p ) p ) r = ( 1 2 p ) + d x ( x + p ) x r 1 p + ( 1 2 p ) + ( 1 2 p ) + 1 d x x r + 1 d x x r + 1 = 1 ( 1 2 p ) + 1 r ( p + ( 1 2 p ) + ) ( 1 r ) + 1 r
for all p ( 0 , 1 ) . Observe that
A ( p ) : = 1 ( 1 2 p ) + 1 r p + ( 1 2 p ) + =   1 ( 1 2 p ) 1 r 1 p 2 , p 0.5 , p 1 2 , p > 0.5 ,
so that A ( p ) 2 and I 2 ( p ) 2 ( 1 r ) 1 + r 1 uniformly with respect to p ( 0 , 1 ) . Hence, we finally obtain
ρ S N r , p , G r , μ   p r Γ ( r ) Γ ( 1 r ) 2 α 2 1 r + 2 1 r + 1 r   = p r ( 2 α 2 + r 1 + 1 ) Γ ( r ) Γ ( 2 r ) .
Recall that the metric ζ F is called regular if
ζ F ( X + Z , Y + Z ) ζ F ( X , Y )
for Z independent of X and Y. In particular, ζ F is regular if F is closed w.r.t. shifts, i.e., f F yields f ( · + c ) F for any c R .
Theorem 2.
Let X 1 , X 2 , be a sequence of i.i.d. r.v.s, S n : = i = 1 n X i for n N , S 0 : = 0 . Let r > 0 , p ( 0 , 1 ) , N r , p NB r , p be independent of { X n } , N p : = N 1 , p , μ = p 1 p , G r , μ G r , μ , E = d G 1 , 1 Exp 1 and ζ F be a regular ζ-structured metric. Then
ζ F S N r , p , G r , μ     r ζ F S N p , 1 p p E + 0 1 ζ F S N y , 1 y y E   ·   h ( y ; { r } , 1 , μ ) d y ,
where the second term in the r.-h.s. vanishes for r N , h y ; r , 1 , p 1 p is given in (8), r is the largest integer that does not exceed r, and { r } = r r is the fractional part of r. In particular, if X 1 , X 2 , are square integrable with E X n = 1 , then
ζ 1 p S N r , p r ( 1 p ) , G r , r   r r · p E X 1 2 1 p ,
where r is the least integer no less than r, and if, in addition, X n 0 a.s. for all n N , then also
ρ S N r , p , G r , μ   = ρ p S N r , p r ( 1 p ) , G r , r     r p max 1 , 1 2 ( 1 p ) E X 1 2 +   p { r } ( 2 E X 1 2 + { r } 1 + 1 ) Γ ( { r } ) Γ ( 2 { r } ) ,
where the second term vanishes in case of r N .
Proof. 
First, consider the case of r N . Due to Equation (2), the distribution of S N r , p coincides with the r-fold convolution of the distribution of geometric random sums; i.e., S N r , p = d k = 1 r S N p ( k ) , where { S N p ( k ) } are independent copies of the geometric random sum S N p , N p Geom 0 p , N p being independent of { X n } . Due to the reproducibility of the gamma distribution w.r.t. the shape parameter r, G r , μ = d k = 1 r E μ ( k ) , where { E μ ( k ) } are independent (and independent of everything else) copies of E μ = d E / μ Exp μ . Next, by applying the triangle inequality and the property of regularity of ζ F for r times, we obtain
ζ F S N r , p , G r , μ = ζ F k = 1 r S N p ( k ) , k = 1 r E μ ( k ) ζ F k = 1 r S N p ( k ) , k = 1 r 1 S N p ( k ) + E μ ( r ) +   ζ F k = 1 r 1 S N p ( k ) + E μ ( r ) , k = 1 r E μ ( k ) ζ F S N p ( r ) , E μ ( r )   +   ζ F k = 1 r 1 S N p ( k ) , k = 1 r 1 E μ ( k )         r ζ F S N p , E μ .
If r N , then, due to the reproducibility of the negative binomial distribution w.r.t. the shape parameter r, we have N r , p = d N r , p + N { r } , p with independent r.v.s. on the r.-h.s. Using the same reasoning as in the above chain of inequalities, we get
ζ F S N r , p , G r , μ = ζ F S N r , p + S N { r } , p , G r , μ + G { r } , μ ζ F S N r , p , G r , μ   +   ζ F S N { r } , p , G { r } , μ   r ζ F S N p , E μ   +   ζ F S N { r } , p , G { r } , μ .
Applying (18) to bound ζ F S N { r } , p , G { r } , μ from above, we obtain (22).
Furthermore, if X 1 , X 2 , are square-integrable with E X n = 1 , then by using upper bounds (17) for ζ 1 S N p , E μ and (19) for ζ 1 S N { r } , p , G { r } , μ , together with the homogeneity of the Kantorovich metric, we obtain
ζ 1 S N r , p , G r , μ   r ζ 1 S N p , E μ + ζ 1 S N { r } , p , G { r } , μ 𝟙 ( r N )   r E X 1 2 + E X 1 2 · 𝟙 ( r N )   =   r   ·   E X 1 2 ,
and hence, using the homogeneity again, we have
ζ 1 p S N r , p r ( 1 p ) , G r , r   = p r ( 1 p ) ζ 1 S N r , p , G r , μ   r r · p E X 1 2 1 p .
Similarly, for the Kolmogorov metric using (14) and (21) we obtain
ρ p S N r , p r ( 1 p ) , G r , r =   ρ S N r , p , G r , μ     r ρ S N p , E μ + ρ S N { r } , p , G { r } , μ 𝟙 ( r N )   r p max 1 , 1 2 ( 1 p ) E X 1 2 + p { r } ( 2 E X 1 2 + { r } 1 + 1 ) Γ ( { r } ) Γ ( 2 { r } ) 𝟙 ( r N ) .

3. Conclusions

In the present paper, we derived the proximity in terms of zeta-structured metrics of generalized negative binomial random sums to generalized gamma distribution by using that of the geometric random sums to the exponential distribution. As a special case, we gave the corresponding upper bounds for the Kantorovich and the Kolmogorov metrics in the law of large numbers for negative binomial random sums of i.i.d. random variables with nonzero first moments and finite second moments.

Author Contributions

Conceptualization, I.S.; methodology, I.S. and M.T.; formal analysis, I.S. and M.T.; investigation, I.S. and M.T.; writing—original draft preparation, I.S. and M.T.; writing—review and editing, I.S. and M.T.; supervision, I.S.; funding acquisition, I.S. All authors have read and agreed to the published version of the manuscript.

Funding

Theorem 2 (Formulas (23) and (24)) was supported by the Ministry of Education and Science of the Russian Federation as part of the program of the Moscow Center for Fundamental and Applied Mathematics under the agreement #075-15-2019-1621. The rest part of the paper was funded by RFBR grants Nos. 20-31-70054, 19-07-01220, and by the grant No. MD-5748.2021.1.1.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
r.v.random variable
i.i.d.independent identically distributed
d.f.distribution function
a.s.almost sure
a.c.absolute continuity, absolutely continuous
w.r.t.with respect to
r.-h.s.right-hand side

References

  1. Korolev, V.; Gorshenin, A. Probability models and statistical tests for extreme precipitation based on generalized negative binomial distributions. Mathematics 2020, 8, 604. [Google Scholar] [CrossRef] [Green Version]
  2. Kalashnikov, V.V. Geometric Sums: Bounds for Rare Events with Applications: Risk Analysis, Reliability, Queueing; Mathematics and Its Applications; Springer: Dordrecht, The Netherlands, 1997. [Google Scholar]
  3. Stacy, E.W. A generalization of the gamma distribution. Ann. Math. Stat. 1962, 33, 1187–1192. [Google Scholar] [CrossRef]
  4. Korolev, V.Y.; Zeifman, A.I. Generalized negative binomial distributions as mixed geometric laws and related limit theorems. Lith. Math. J. 2019, 59, 366–388. [Google Scholar] [CrossRef] [Green Version]
  5. Zaks, L.M.; Korolev, V.Y. Generalized variance gamma distributions as limit laws for random sums. Inform. Appl. 2013, 7, 105–115. [Google Scholar]
  6. Korolev, V.Y. Analogs of Gleser’s theorem for negative binomial and generalized gamma distributions and some of their applications. Inform. Primen. 2017, 11, 2–17. [Google Scholar]
  7. Brown, M. Error bounds for exponential approximations of geometric convolutions. Ann. Probab. 1990, 18, 1388–1402. [Google Scholar] [CrossRef]
  8. Solovyev, A.D. Asymptotic behaviour of the time of first occurrence of a rare event. Engrg. Cybern. 1971, 9, 1038–1048. [Google Scholar]
  9. Kalashnikov, V.V.; Vsekhsvyatskii, S.Y. Metric estimates of the first occurrence time in regenerative processes. In Stability Problems for Stochastic Models. Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 1985; Volume 1155, pp. 102–130. [Google Scholar] [CrossRef]
  10. Sugakova, E.V. Estimates in the Rényi theorem for differently distributed terms. Ukr. Math. J. 1995, 47, 1128–1134. [Google Scholar] [CrossRef]
  11. Peköz, E.A.; Röllin, A. New rates for exponential approximation and the theorems of Rényi and Yaglom. Ann. Probab. 2011, 39, 587–608. [Google Scholar] [CrossRef] [Green Version]
  12. Hung, T.L. On the rate of convergence in limit theorems for geometric sums. Southeast Asian J. Sci. 2013, 2, 117–130. [Google Scholar]
  13. Shevtsova, I.; Tselishchev, M. A generalized equilibrium transform with application to error bounds in the Rényi theorem with no support constraints. Mathematics 2020, 8, 577. [Google Scholar] [CrossRef]
  14. Kruglov, V.M.; Korolev, V.Y. Limit Theorems for Random Sums; Moscow State University: Moscow, Russia, 1990. (In Russian) [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Shevtsova, I.; Tselishchev, M. On the Accuracy of the Generalized Gamma Approximation to Generalized Negative Binomial Random Sums. Mathematics 2021, 9, 1571. https://doi.org/10.3390/math9131571

AMA Style

Shevtsova I, Tselishchev M. On the Accuracy of the Generalized Gamma Approximation to Generalized Negative Binomial Random Sums. Mathematics. 2021; 9(13):1571. https://doi.org/10.3390/math9131571

Chicago/Turabian Style

Shevtsova, Irina, and Mikhail Tselishchev. 2021. "On the Accuracy of the Generalized Gamma Approximation to Generalized Negative Binomial Random Sums" Mathematics 9, no. 13: 1571. https://doi.org/10.3390/math9131571

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop