Pseudo Compound Poisson Distributions in Risk Theory
W. Hürlimann
ASTIN Bulletin, 1990, vol. 20, issue 1, 57-79
Abstract:
Using Laplace transforms and the notion of a pseudo compound Poisson distribution, some risk theoretical results are revisited. A well-known theorem by Feller (1968) and Van Harn (1978) on infinitely divisible distributions is generalized. The result may be used for the efficient evaluation of convolutions for some distributions. In the particular arithmetic case, alternate formulae to those recently proposed by De Pril (1985) are derived and shown more adequate in some cases. The individual model of risk theory is shown to be pseudo compound Poisson. It is thus computable using numerical tools from the theory of integral equations in the continuous case, a formula of Panjer type or the Fast Fourier transform in the arithmetic case. In particular our results contain some of De Pril's (1986/89) recursive formulae for the individual life model with one and multiple causes of decrement. As practical illustration of the continuous case we construct a new two-parametric family of claim size density functions whose corresponding compound Poisson distributions are analytical finite sum expressions. Analytical expressions for the finite and infinite time ruin probabilities are also derived.
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
https://www.cambridge.org/core/product/identifier/ ... type/journal_article link to article abstract page (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:cup:astinb:v:20:y:1990:i:01:p:57-79_00
Access Statistics for this article
More articles in ASTIN Bulletin from Cambridge University Press Cambridge University Press, UPH, Shaftesbury Road, Cambridge CB2 8BS UK.
Bibliographic data for series maintained by Kirk Stebbing ().