Publisher： Cambridge University Press
E-ISSN： 1783-1350|28|2|241-255
ISSN： 0515-0361
Source： ASTIN Bulletin, Vol.28, Iss.2, 1998-11, pp. : 241-255
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
The Kolmogorov distance is used to transform arithmetic severities into equispaced arithmetic severities in order to reduce the number of calculations when using algorithms like Panjer's formulae for compound distributions. An upper bound is given for the Kolmogorov distance between the true compound distribution and the transformed one. Advantages of the Kolmogorov distance and disadvantages of the total variation distance are discussed. When the bounds are too big, a Berry-Esseen result can be used. Then almost every case can be handled by the techniques described in this paper. Numerical examples show the interest of the methods.
Related content
Sundt and Jewell's Family of Discrete Distributions
ASTIN Bulletin, Vol. 18, Iss. 1, 1988-04 ,pp. :
Access to resources
Recommend
EM Algorithm for Mixed Poisson and Other Discrete Distributions
ASTIN Bulletin, Vol. 35, Iss. 1, 2005-05 ,pp. :
A Review on Phase-type Distributions and their Use in Risk Theory
ASTIN Bulletin, Vol. 35, Iss. 1, 2005-05 ,pp. :
Recursions for certain bivariate counting distributions and their compound distributions
ASTIN Bulletin, Vol. 26, Iss. 1, 1996-05 ,pp. :