×

Explicit expressions for the ruin probabilities of Erlang risk processes with Pareto individual claim distributions. (English) Zbl 1054.62129

The risk process in which claim arrival times have an Erlang distribution and the claim size follows a Pareto distribution is considered. An explicit expression for the probability of ruin \(\Psi(n)\) is given. It is shown that \(\Psi(n)\) can be expressed as the sum of expected values of functions of gamma random variables. Numerical examples of the main results are given.

MSC:

62P05 Applications of statistics to actuarial sciences and financial mathematics
91B30 Risk theory, insurance (MSC2010)
Full Text: DOI

References:

[1] Abramowitz, M., Stegun, I.A. Handbook of mathematical functions. Dover Publications, New York, 1965 · Zbl 0171.38503
[2] Davies, B. Integral transforms and their applications. Springer-Verlag, New York, 1978 · Zbl 0381.44001
[3] Dickson, D.C.M. On a class of renewal risk processes. North American Actuarial Journal, 2(3): 60–73 (1998) · Zbl 1081.60549
[4] Dickson, D.C.M., Hipp, C. Ruin probabilities for Erlang(2) risk processes. Insurance: Mathematics and Economics , 22: 251–262 (1998) · Zbl 0907.90097 · doi:10.1016/S0167-6687(98)00003-1
[5] Dyke, P.P.G. An introduction to laplace transforms and Fourier series. Springer, London, 2000 · Zbl 0933.44001
[6] Lang, S. Complex analysis. Springer-Verlag, New York, 1993
[7] Olver, F.W.J. Asymptotics and special functions. Academic Press, New York, 1974 · Zbl 0303.41035
[8] Ramsay, C.M. A solution to the ruin problem for Pareto distributions. Insurance: Mathematics and Economics, 33: 109–116, (2003) · Zbl 1055.91056 · doi:10.1016/S0167-6687(03)00147-1
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.