1. Introduction
The Sparre Andersen model is a classical object of study in insurance risk theory, see e.g.,
Labbé and Sendova (
2009);
Li and Garrido (
2005);
Temnov (
2004,
2014);
Willmot (
2007); and
Asmussen and Albrecher (
2010) for an overview. In this model, claims occur according to a renewal process, which generalises the Cramér–Lundberg model, where claims arrive according to a Poisson process. Ruin probabilities in such a general setting are typically expressed as solutions of defective renewal equations, differential equations, the socalled Wiener–Hopf factorisation, etc., but the latter are typically inadequate to be used for numerical computations. However, if either the interclaim times or the claim sizes belong to the class of phasetype distributions, then ruinrelated quantities can be found in an explicit form; see, e.g.,
Albrecher and Boxma (
2005);
Dickson (
1998);
Li and Garrido (
2005) and
Landriault and Willmot (
2008), respectively.
However, in many relevant situations in practice, the behaviour of the claim sizes is better captured by heavytailed distributions (
Embrechts et al. 1997); however, in that case, explicit expressions are hard or impossible to evaluate even in terms of Laplace transforms. Under a heavytailed setting, a standard approach is hence to seek for asymptotic approximations (
Albrecher et al. 2012;
Dong and Liu 2013;
Wei et al. 2008), for initial capital levels being very large. At the same time, this capital level typically has to be very large, so as to be reasonably accurate, when actual magnitudes matter. One mathematically appealing solution is then to look for higherorder approximations (see e.g.,
Albrecher et al. 2010); but, then an actual error bound for fixed values also cannot be given. Another alternative is to approximate the actual heavytailed claim distribution by a tractable lighttailed one and control the introduced error in some way. Spectral approximations in this spirit were recently developed in
Vatamidou et al. (
2014) for the classical Cramér–Lundberg model.
The present paper proposes an extension of techniques in
Vatamidou et al. (
2014) to the more general Sparre Andersen model, and at the same time improves the bound derived there and the efficiency of the algorithm to establish it. Using the geometric compound tail representation of the ruin probability, we derive our error bound in terms of the ladder height distribution, which is explicitly available when the distribution of the interclaim times has a rational Laplace transform. We focus on heavytailed claim sizes, where numerical evaluations of ruin probabilities are typically challenging, and we develop an algorithm for the class of completely monotone distributions. Concretely, we approximate the ladder height distribution by a hyperexponential distribution, and we are able to prescribe the number of required phases for a desired resulting accuracy for the ruin probability.
The rest of the paper is organised as follows. In
Section 2, we introduce the model and provide the exact formula for the ladder height distribution. As a next step, we derive, in
Section 3, the error bound for the ruin probability, and we construct our approximation algorithm. In
Section 4, we compare our approximations with existing asymptotic approximations. In
Section 5, we then perform an extensive numerical analysis to check the tightness of the bound and the quality of the derived approximations. Finally, we conclude in
Section 6.
2. Model Description
Consider the Sparre Andersen risk model for an insurance surplus process defined as
where
$u\ge 0$ is the initial capital,
$c>0$ is the constant premium rate and the i.i.d. positive random variables
${\left\{{X}_{i}\right\}}_{i\ge 1}$ with distribution function
${F}_{X}$ represent the claim sizes. The counting process
$\{N(t),t\ge 0\}$ denotes the number of claims within
$[0,t]$ and is defined as
$N(t)=max\{n\in {\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{N}}_{}:{W}_{1}+{W}_{2}+\dots {W}_{n}\le t\}$, where the interclaim times
${W}_{i}$ are assumed to be i.i.d. with common distribution function
K, independent of the claim sizes; see, e.g.,
Asmussen and Albrecher (
2010). We also assume
$c{\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{W}_{}>{\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{X}_{}$, providing a positive safety loading condition.
Now, let
$T=inf\{t\ge 0:R(t)<0\}$ be the time of ultimate ruin. Then, the ruin probability is defined as
The ruin probability satisfies the defective renewal equation
where
$\varphi =\psi (0)$,
$H(u)$ is the distribution of the ascending ladder height associated with the surplus process
$S(t):=uR(t)$ and
$\overline{H}(u)=1H(u)$, for
$u\ge 0$; see, e.g.,
Willmot et al. (
2001). The solution to Equation (
3) is the Pollaczek–Khintchinetype formula
i.e.,
$\psi (u)$ is a geometric compound tail with geometric parameter
$\varphi $; see Section 1.2.3 in
Willmot and Woo (
2017) for details.
Although Equation (
4) provides a closedform formula for the ruin probability, it is impractical, because the ladder height distribution
$H(u)$ is not available in most cases of interest. However, when the distribution
K of the interclaim times has a rational Laplace transform,
$H(u)$ has an explicit form (
Li and Garrido 2005), which we recall in the next subsection. In the sequel, we will then use this as a starting point for developing highly accurate approximations for
$\psi (u)$, which is of particular interest for heavytailed claim sizes.
3. Spectral Approximation for the Ruin Probability
The starting point for the approximation of
$\psi (u)$ is its geometric compound tail representation in Equation (
4). Note that this representation is similar to the Pollaczek–Khintchine formula for
$\psi (u)$ in the Cramér–Lundberg model where
$\varphi $ is replaced by the average amount of claim per unit time
$\rho <1$ and the ladder height distribution is equal to the stationary excess claim size distribution. Therefore, following the reasoning in
Vatamidou et al. (
2014), we will approximate the ladder height distribution by a hyperexponential distribution (which has a rational Laplace transform), to construct approximations for the ruin probability.
3.1. Error Bound for the Ruin Probability
Let
$\widehat{H}(u)$ be an approximation of the ladder height distribution
$H(u)$ and
$\widehat{\psi}(u)$ be the exact result we obtain from (
4) when we use
$\widehat{H}(u)$. From Equation (
4) and the triangle inequality, the error between the ruin probability and its approximation then is
If we define the sup norm distance between two distribution functions ${F}_{1}$ and ${F}_{2}$ as $\mathcal{D}({F}_{1},{F}_{2}):={sup}_{x}{F}_{1}(x){F}_{2}(x)$, $x\ge 0$ (also referred to as Kolmogorov metric), the following result holds.
Theorem 1. A bound for the approximation error of the ruin probability is Proof. The result is a direct application of Theorem 4.1 of
Peralta et al. (
2018) by (i) choosing the functions
${\widehat{F}}_{1}$ and
${\widehat{F}}_{2}$ to be
H and
$\widehat{H}$, respectively; (ii) taking
$\rho =\varphi $; and (iii) recognising that
${sup}_{y<u}\left(\right)open="\{"\; close="\}">\leftH(y)\widehat{H}(y)\right$. □
Remark 1. As ${lim}_{u\to +\infty}H(u)={lim}_{u\to +\infty}\widehat{H}(u)=1$, it is immediately obvious that the bound converges to $\mathcal{D}(H,\widehat{H})\varphi /(1\varphi )$, which means that the bound is asymptotically uniform in u.
To sum up, when the ladder height distribution is approximated with some desired accuracy, a bound for the ruin probability is guaranteed by Theorem 1. Although this result holds for any approximation $\widehat{H}$ of H, we will in the sequel focus on hyperexponential approximations, as these lead to very tractable expressions and at the same time are sufficiently accurate for the purpose. Consequently, our next goal is to construct an algorithm to approximate the ladder height distribution by a hyperexponential distribution.
3.2. Completely Monotone Claim Sizes
We are mostly interested in evaluating ruin probabilities when the claim sizes follow a heavytailed distribution, such as Pareto or Weibull. These two distributions belong to the class of completely monotone distributions.
Definition 1. A pdf f is said to be completely monotone (c.m.) if all derivatives of f exist and if Completely monotone distributions can be approximated arbitrarily closely by hyperexponentials; see, e.g.,
Feldmann and Whitt (
1998). Here, we provide a method to approximate a completely monotone ladder height distribution with a hyperexponential one to achieve any desired accuracy for the ruin probability. The following result is standard; see
Feller (
1971).
Theorem 2. A ccdf $\overline{F}$ is completely monotone if and only if it is the Laplace–Stieltjes transform of some probability distribution S defined on the positive halfline, i.e., We call S the spectral cdf.
Remark 2. With a slight abuse of terminology, we will say that a function S is the spectral cdf of a distribution if it is the spectral cdf of its ccdf.
Note that Theorem 2 also extends to the case where $S(y)$ is not a distribution but simply a finite measure on the positive halfline, i.e., a function f is completely monotone if and only if it can be expressed as the Laplace–Stieltjes integral of such a finite measure $S(y)$. We will show that under the assumption that the claim size distribution is c.m. and the ladder height distribution is c.m. too. We first need the following intermediate result.
Lemma 1. If the ccdf ${\overline{F}}_{X}(u)$ is c.m., then ${\mathcal{T}}_{{\rho}_{n}}{\overline{F}}_{X}(u)$ is a c.m. function, $\forall n=1,\dots ,N$.
Proof. Assume that the claim sizes are completely monotone, i.e.,
${\overline{F}}_{X}(u)={\int}_{0}^{\infty}{e}^{uy}dS(y)$, for some spectral cdf
$S(y)$. In this case, it holds that
where
$d{S}_{{\mathcal{T}}_{{\rho}_{n}}}(y)=\frac{dS(y)}{y+{\rho}_{n}}$,
$n=1,\dots ,N$, is a finite measure on the positive halfline with
${S}_{{\mathcal{T}}_{{\rho}_{n}}}(+\infty )=(1{\tilde{f}}_{X}({\rho}_{n}))/{\rho}_{n}$,
$n=1,\dots ,N1$, and
${S}_{{\mathcal{T}}_{0}}(+\infty )={\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{X}_{}$. □
We can now state the following result.
Proposition 1. If the ccdf ${\overline{F}}_{X}(u)$ is c.m., i.e., ${\overline{F}}_{X}(u)={\int}_{0}^{\infty}{e}^{uy}dS(y)$, for some spectral cdf $S(y)$, then the ladder height distribution is c.m. too, i.e., $\overline{H}(u)={\int}_{0}^{\infty}{e}^{uy}d{S}_{H}(y)$, where ${S}_{H}(y)$ is a spectral cdf such that Proof. It was proven in
Chiu and Yin (
2014) that the ascending ladder height distribution in the Sparre Andersen model is c.m. if the claim size distribution is c.m, meaning that
$\overline{H}(u)$ can be represented as the Laplace–Stieltjes transform of some spectal cdf
${S}_{H}(y)$. Due to the uniqueness of Laplace transforms, it, therefore, suffices to find the formula of the spectral cdf
${S}_{H}(y)$ by applying Lemma 1 to (
8). □
We show in the next section how to utilise the above results to construct approximations for the ruin probability $\psi (u)$ that have a guaranteed error bound given by Theorem 1.
3.3. Approximation Algorithm
Following the proof of Lemma 2 in
Vatamidou et al. (
2014), we can directly deduce the following result.
Lemma 2. Let ${S}_{H}$ be the spectral cdf of the c.m. ladder height distribution H and ${\widehat{S}}_{H}$ a step function such that $\mathcal{D}({S}_{H},{\widehat{S}}_{H})\le \u03f5$. Consequently, $\mathcal{D}(H,\widehat{H})\le \u03f5$, where $\widehat{H}$ is the c.m. approximate ladder height distribution with spectral cdf ${\widehat{S}}_{H}$.
The above lemma states that if we want to approximate a c.m. ladder height distribution with a hyperexponential one with some fixed accuracy
$\u03f5$, it suffices to approximate its spectral cdf with a step function with the same accuracy. As pointed out in Remark 1 of
Vatamidou et al. (
2014), we could approximate
${S}_{H}$ with a step function having
k jumps that occur at the quantiles
${\lambda}_{i}$, such that
${S}_{H}({\lambda}_{i})=i/(k+1)$,
$i=1,\dots ,k$ and are all of size
$1/k$ to achieve
$\mathcal{D}(H,\widehat{H})\le \u03f5=1/(k+1)$. Another possibility is to use the step function in Step 4d of our Algorithm 1; see also
Figure 1 for a graphical representation of the approximate step function and its corresponding hyperexponential distribution. Clearly, this new step function leads to
$\mathcal{D}(H,\widehat{H})\le \u03f5=1/2(k1)$.
The error bound for the approximate ruin probability $\widehat{\psi}(u)$ can be calculated afterwards through Theorem 1. An interesting question in this context is how many phases k for the approximate ladder height distribution suffice to guarantee an error bound $\psi (u)\widehat{\psi}(u)\le \delta $ for some predetermined $\delta >0$. We answer this question in the next lemma.
Lemma 3. To achieve $\psi (u)\widehat{\psi}(u)\le \delta $ for some predetermined $\delta >0$, the ladder height distribution $H(u)$ must be approximated by a hyperexponential one with at least k phases, such thatwhere $\u2308x\u2309$ is the integer that is greater than or equal to x but smaller than $x+1$. Proof. Observe that the error bound in Theorem 1 depends on the approximate hyperexponential distribution
$\widehat{H}(u)$, which means that one should first determine
$\widehat{H}(u)$ and then calculate the error bound. However, when
$\mathcal{D}(H,\widehat{H})\le \u03f5$, this translates to
$H(u)\u03f5\le \widehat{H}(u)\le H(u)+\u03f5$. Therefore, the worstcase scenario for the bound is when
$\widehat{H}(u)=H(u)+\u03f5$ and consequently
$\mathcal{D}(H,\widehat{H})=\u03f5$. As a result, if we want to achieve
$\psi (u)\widehat{\psi}(u)\le \delta $ for all possible scenarios of
$\widehat{H}(u)$, we should solve the inequality
with respect to
$\u03f5$. By substituting
$\u03f5=1/2(k1)$, we calculate
In addition, the bound is asymptotically equal to
$\u03f5\varphi /(1\varphi )$ according to Remark 1. Consequently, it must also hold that
Finally, as the number of phases
k must be an integer, the smallest possible integer that satisfies at least one of the inequalities is the one described in Equation (
12). □
After this, we present our algorithm under the setting that we fix the desired accuracy $\delta $ for the approximation of the ruin probability $\widehat{\psi}(u)$.
Algorithm 1. Spectral Approximation 
Steps: 
Calculate the roots ${\rho}_{n}$, $n=1,\dots ,N1$ using Equation ( 6). Find the spectral cdf $S(y)$ of ${\overline{F}}_{X}(x)$. Use Proposition 1 to calculate the spectral cdf ${S}_{H}(y)$ of $\overline{H}(u)$. Approximate $\overline{H}(u)$ by a hyperexponential distribution with k phases.
 (a)
Choose the accuracy of the ruin probability $\delta $ for a fixed $u>0$.  (b)
Calculate k required to achieve this accuracy using Lemma 3 and set $\u03f5=\frac{1}{2(k1)}$.  (c)
Define k quantiles such that ${S}_{H}({\lambda}_{1})=\u03f5$, ${S}_{H}({\lambda}_{i})=2(i1)\u03f5$, $i=2,\dots ,k1$, and ${S}_{H}({\lambda}_{k})=1\u03f5$.  (d)
Approximate the spectral cdf ${S}_{H}(y)$ with the step function
 (e)
Find the ladder height distribution $\widehat{\overline{H}}(u)=\left(\right)open="["\; close="]">{e}^{{\lambda}_{1}u}+2{\sum}_{i=2}^{k1}{e}^{{\lambda}_{i}u}+{e}^{{\lambda}_{k}u}$ and calculate its Laplace transform $\mathcal{L}\left(\right)open="\{"\; close="\}">\widehat{\overline{H}}(u)$.
Calculate the Laplace transform of the ruin probability as $\mathcal{L}\left(\right)open="\{"\; close="\}">\widehat{\psi}(u)(s)=\frac{\varphi \mathcal{L}\left(\right)open="\{"\; close="\}">\widehat{\overline{H}}(u)}{(s)}\varphi s\mathcal{L}\left(\right)open="\{"\; close="\}">\widehat{\overline{H}}(u)(s)+1\varphi$. Use simple fraction decomposition to determine positive real numbers ${R}_{i}$, ${\eta}_{i}$, $i=1,\dots ,k$, with ${\sum}_{i=1}^{k}{R}_{i}=1$, such that $\mathcal{L}\left(\right)open="\{"\; close="\}">\widehat{\psi}(u)(s)=\varphi \sum _{i=1}^{k}{R}_{i}\frac{1}{s+{\eta}_{i}}$. Invert the previous Laplace transform to find $\widehat{\psi}(u)=\varphi \sum _{i=1}^{k}{R}_{i}{e}^{{\eta}_{i}u}$, $u\ge 0$. The accuracy for $\widehat{\psi}(u)$ is then $\frac{\mathcal{D}(H,\widehat{H})(1\varphi )\varphi}{\left(\right)open="("\; close=")">1\varphi H(u)}$, $\forall u>0$.

Remark 3. The decomposition of $\mathcal{L}\left(\right)open="\{"\; close="\}">\widehat{\psi}(u)$ at Step 6 is guaranteed by Asmussen and Rolski (1992), who showed that the ruin probability in the Sparre Andersen model has a phasetype representation when the claim sizes are phasetype. Moreover, the particular hyperexponential representation of $\widehat{\psi}(u)$ at Step 7 occurs because the poles of $\mathcal{L}\left(\right)open="\{"\; close="\}">\widehat{\psi}(u)$ are exactly the roots of the polynomial function ${P}_{\varphi}(s)={\prod}_{i=1}^{k}(s+{\lambda}_{i})\varphi \left(\right)open="("\; close=")">{\prod}_{i=1}^{k}(s+{\lambda}_{i})s{\left(\right)}^{{\prod}_{i=1}^{k}}\prime $, where ${\delta}_{ij}$ is the Kronecker delta. It is immediate from perturbation theory that ${P}_{\varphi}(s)$ has exactly k simple roots analytic in ϕ; see Baumgärtel (1985) for details. Remark 4. The above algorithm is an extension of the one developed for the Cramér–Lundberg model in Vatamidou et al. (2014), to which we refer for further details on technical implementation. 4. Asymptotic Approximation
In many cases, it is of importance to investigate the asymptotic behaviour of the ruin probability when the initial risk reserve tends to infinity. This question is particularly interesting in the case of heavytailed claim sizes. Towards this direction, when the claim sizes belong to the class of subexponential distributions
$\mathcal{S}$ (
Teugels 1975), e.g., Pareto, Weibull, Lognormal, etc., the following asymptotic approximation is classical (see, e.g.,
Embrechts and Veraverbeke 1982):
Theorem 3. Suppose in the general Sparre Andersen model that the claim sizes and interclaim times have both finite means ${\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{X}_{}$ and ${\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{W}_{}$, respectively, such that $c{\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{W}_{}>{\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{X}_{}$. If $\frac{1}{{\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{X}_{}}{\int}_{0}^{u}{\overline{F}}_{X}(x)dx\in \mathcal{S}$, then Note that the heavytail approximation
${\psi}_{\mathcal{S}}(u)$ holds for any interclaim time distribution. However, further modifications have been attained in
Willmot (
1999), when the Laplace transform of the interclaim times is a rational function of the form (
5) with
$\beta (s)=\beta $ and
${F}_{X}$ belongs to the subclass of regularly varying distributions, i.e.,
${\overline{F}}_{X}(u)\sim L(u){u}^{\alpha 1}{e}^{\gamma u}$,
$u\to +\infty $, where
$L(u)$ a slowly varying function and
$\alpha >0$,
$\gamma \ge 0$. For example, the Pareto
$(a,b)$ distribution (see
Section 5.2.1) belongs to the class of regularly varying distributions with
$L(u)={\left(\right)}^{b}a$,
$\alpha =a1$ and
$\gamma =0$, and its modified asymptotic approximation is then given by
which is smaller than
${\psi}_{\mathcal{S}}(u)$ by a factor
$\frac{bu}{bu+1}$ that converges to 1 as
$u\to +\infty $; see
Willmot (
1999) for details.
Clearly, the heavytail approximation admits a simple formula whenever the expectations of the interclaim times and claim sizes are finite; however, it has a drawback that occurs when $c{\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{W}_{}\approx {\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{X}_{}$ the approximation is useful only for extremely large values of u.
In the next section, we compare the accuracy of the spectral approximation to the accuracy of the heavy tail one, i.e., ${\psi}_{\mathcal{S}}(u)$. An interesting observation is that the spectral approximation converges faster to zero than any heavytailed distribution due to the exponential decay rate of the former. Thus, the heavytail approximation is expected to outperform the spectral approximation in the far tail, but for medium values, this new approximation can be very competitive.
5. Numerical Analysis
The goal of this section is to implement our algorithm in order to check the accuracy of the spectral approximation and the tightness of its accompanying bound, which is given in Theorem 1. To perform the numerical examples, we need to make a selection for the distribution K of the interclaim times as well as the claim size distribution ${F}_{X}$.
5.1. Interclaims Times
We choose a hyperexponential distribution with two phases, i.e.,
$K\sim {H}_{2}(\theta ,1\theta ;{\nu}_{1},{\nu}_{2})$, such that
$\tilde{k}(s)=\frac{{\nu}_{1}{\nu}_{2}+s\left(\right)open="("\; close=")">\theta {\nu}_{1}+(1\theta ){\nu}_{2}}{}(s+{\nu}_{1})(s+{\nu}_{2})$. As
$N=2$, it is evident that there exists only one positive and real root
${\rho}_{1}$ to the generalised Lundberg equation of Equation (
6). Therefore, given also that
$\beta (s)=\theta {\nu}_{1}+(1\theta ){\nu}_{2}$, the ladder height distribution takes the form
which is in accordance with
Li and Garrido (
2005).
5.2. Claim Sizes
For the claim sizes, we consider the Pareto$(a,b)$ distribution with shape parameter $a>0$ and scale parameter $b>0$ and the Weibull$(c,a)$ distribution with c and a positive shape and scale parameters, respectively.
5.2.1. Pareto
This distribution is c.m., as its ccdf
${\overline{F}}_{X}(x)={(1+bu)}^{a}$ can be written as the LST of the Gamma distribution with shape and scale parameters
a and
b, respectively, i.e.,
The
nth moment of the Pareto distribution exists if and only if the shape parameter is greater than
n. As we are interested in comparing the spectral approximation to the asymptotic approximation of
Section 4, it is necessary to have a finite first moment for the claim sizes. Therefore, the shape parameter
a must be chosen to be greater than 1.
Using Proposition 1, we can easily verify that
5.2.2. Weibull
It can be verified that the ccdf
${\overline{F}}_{X}(x)={e}^{{(u/a)}^{c}}$ with fixed shape parameter
$c=1/2$ arises as a c.m. distribution (
Jewell 1982), where the mixing measure (measure of the spectral function)
S is given by
Similarly, we can find using Proposition 1 that
5.3. Numerical Results
The goal of this section is to implement our algorithm to check the accuracy of the spectral approximation and the tightness of its accompanying bound, which is given in Theorem 1.
For Pareto claim sizes, we choose $a=2$, $b=3$, $c=1$, $\theta =0.4$, ${\nu}_{1}=1$ and ${\nu}_{2}=5$, and we obtain ${\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{W}_{}=0.52$, ${\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{X}_{}=0.33$ and $\varphi =0.72897$. For Weibull claim sizes, we choose $a=3$, $c=1$, $\theta =0.2$, ${\nu}_{1}=1$ and ${\nu}_{2}=1/9$, and we obtain ${\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{W}_{}=7.4$, ${\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{X}_{}=6$ and $\varphi =0.83184$. Note that we performed extensive numerical experiments for various combinations of parameters, but we chose to present only these two cases since the qualitative conclusions are comparable among all cases. Our experiments are illustrated below.
Impact of phases. It is intuitively true that the spectral approximation becomes more accurate as the number of phases increases. To test this hypothesis, we compare three different spectral approximations with number of phases 10, 30 and 100, respectively, with the exact value of the ruin probability (which we obtain through simulation). We display our results in
Table 1 only for Pareto claim sizes. The conclusion is that, indeed, a more accurate spectral approximation is achieved, as the number of phases increases for every fixed initial capital
u, which is in line with expectations.
Quality of the bound. A compelling question regarding the bound is if it is strict or pessimistic, i.e., how far it is from the true error of the spectral approximation. To answer this question, we first need to determine the accuracy
$\delta $ we would like to guarantee for the ruin probability. Using Lemma 3, we present, in
Figure 2, the number of phases required in order to guarantee
$\delta =0.02$ under Pareto
$(2,3)$ claim sizes and
$\delta =0.05$ under Weibull
$(0.5,3)$ claim sizes as a function of
u. For
$u=30$, the required number of phases is equal to
$k=67$ in the Pareto case. Similarly, we find that
$k=11$ for
$u=17$ in the Weibull case. We generate the spectral approximations with 67 and 11 phases, respectively, and compare in
Figure 3 the true error (difference between simulation and spectral approximation) with the predicted error bound of Theorem 1 (green dotted line). The dashed cyan line in the left graph represents the worstcase scenario for the bound that was used in the proof of Lemma 3 to calculate the optimal number of phases to guarantee an error of at most
$\delta =0.02$ up to
$u=30$.
As we can observe in
Figure 3, the true error is significantly smaller than the predicted error bound for small values of
u, under Pareto
$(2,3)$ claim sizes. This may be because, for small values of
u, a smaller number of phases
k is enough to guarantee
$\delta =0.02$; see also
Figure 2. Afterwards, the true error increases to the error bound by reaching its maximum value close to
$u=40$, and then drops to zero as
$u\to \infty $, whereas the predicted bound remains constant. A similar behaviour is recognised under Weibull
$(0.5,3)$ claim sizes, where now the true error is close to the predicted error bound for small values of
u, as
$k=11$ is already a small number itself.
Finally, notice that the predicted error bound is almost 4 times smaller than
$\delta =0.02$ in the Pareto case. This happens because
$\mathcal{D}(H,\widehat{H})$ could be a lot smaller than
$\u03f5$; see also
Figure 1 where
$\mathcal{D}(H,\widehat{H})<0.1$. However, most importantly, the true error is close to the predicted bound, and thus we can say that Lemma 3 provides a good proxy for the necessary number of phases
k to achieve it.
Comparison between spectral and heavytail approximations. As we pointed out in
Section 4, the spectral approximation is expected to underestimate both the exact ruin probability and the asymptotic approximation
${\psi}_{\mathcal{S}}(u)$ in Theorem 3 for large
u, due to its exponential decay rate. It is of interest to see the magnitude of
u for which the asymptotic approximation outperforms the spectral approximation.
We select the spectral approximations with
$k=67$ phases for Pareto
$(2,3)$ claim sizes and
$k=11$ phases for Weibull
$(0.5,3)$ claim sizes, as in the previous experiment, and present the distributions in a graph. The pink shadow in
Figure 4 enfolding the spectral approximation represents its bound. We observe that for small values of
u, the spectral approximation is more accurate than the heavytail approximation, where the second provides a rough estimate of the ruin probability. On the other hand, the heavytail approximation is slightly more accurate than the spectral approximation in the tail, i.e., for
$u>25$, under Pareto claim sizes. However, for the Weibull case, we observe that, even for values of
u around 300, the spectral approximation still outperforms the heavytail approximation.
6. Conclusions
In this paper, we considered the ruin probability of the Sparre Andersen model with heavytailed claim sizes and interclaim times with rational Laplace transform. Using the geometric random sum representation, we developed an explicit bound and also constructed a spectral approximation by approximating the c.m. ladder height distribution with a hyperexponential one. Our spectral approximation algorithm advances on the algorithm established in
Vatamidou et al. (
2014) in various aspects. We provide below a summary of our conclusions both for the spectral approximation and the bound.
When comparing with the technique proposed in
Vatamidou et al. (
2014), the strategic selection of the quantiles in Step 4d reduces the number of phases to almost a half, to guarantee a certain accuracy for the ladder height distribution.
As the bound depends on the initial capital, we were able to focus on one area and optimise the required number of phases to achieve a desired accuracy, e.g., we would need 110 phases for $u=5$ and 132 phases for $u=30$ to guarantee accuracy of at most $\delta =0.01$ in our example.
The step function is constructed to guarantee $\mathcal{D}(H,\widehat{H})\le \u03f5$, but in most applications $\mathcal{D}(H,\widehat{H})$ is a lot smaller than $\u03f5$. Thus, the use of $\mathcal{D}(H,\widehat{H})$ in the bound makes it tighter.
To sum up, the spectral approximation is highly accurate for all values of u as opposed to the heavytail approximation, which fails to provide a good fit for small values. Moreover, it is accompanied by a rather tight bound.
Finally, note that the results of this paper are also valid for the risk model with twosided jumps, i.e.,
where
u,
c and
${X}_{i}$ are defined as before, whereas
${N}_{+}(t)$ and
${N}_{}(t)$ are independent Poisson processes with intensities
${\lambda}_{+}$ and
${\lambda}_{}$, respectively; see, e.g.,
Albrecher et al. (
2010). In addition, the sequence
${\left\{{Y}_{j}\right\}}_{i\ge 1}$ of i.i.d. r.v.’s, independent of
${\left\{{X}_{i}\right\}}_{j\ge 1}$,
${N}_{+}(t)$ and
${N}_{}(t)$, and having the common d.f.
${G}_{Y}$ that belongs to the class of distributions with rational Laplace transform, are the sizes of premium payments. The positive security loading condition in this model becomes
$c+{\lambda}_{+}{\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{Y}_{}>{\lambda}_{}{\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{E}}_{}{X}_{}$.
Let
${\tau}_{n}$ be the time when the
nth claim occurs with
${\tau}_{0}=0$. As ruin occurs only at the epochs when claims occur, we define the discrete time process
${\stackrel{\u02c7}{R}}_{}=\{{\stackrel{\u02c7}{R}}_{n}:n=0,1,2,\dots \}$, where
${\stackrel{\u02c7}{R}}_{0}=0$ and
${\stackrel{\u02c7}{R}}_{n}=\stackrel{\u02c7}{R}({\tau}_{n})$, which denotes the surplus immediately after the
nth claim, i.e.,
where
${\stackrel{\u02c7}{\tau}}_{n}={\tau}_{n}+{\sum}_{j=1}^{{N}_{+}({\tau}_{n})}{Y}_{j}/c$ with
${\stackrel{\u02c7}{\tau}}_{0}=0$. Equation (
14) corresponds to the discretetime embedded process of the Sparre Andersen risk model (
1), and the counting process
$N(t)$ denotes the number of claims up to time
t with the modified interclaim times
${W}_{i}={\stackrel{\u02c7}{\tau}}_{j}{\stackrel{\u02c7}{\tau}}_{j1}$. Clearly,
where
${\tilde{g}}_{Y}(s)={\int}_{0}^{+\infty}{e}^{sx}d{G}_{Y}(x)$ is the Laplace transform of the premium payments; see
Dong and Liu (
2013). Let now
$\stackrel{\u02c7}{T}=inf\{t\ge 0\mid \stackrel{\u02c7}{R}(t)<0\}$ and
$\stackrel{\u02c7}{\psi}(u)={\mathrm{I}\phantom{\rule{0.2em}{0ex}}\mathrm{P}}_{}(\stackrel{\u02c7}{T}<\infty \mid \stackrel{\u02c7}{R}(0)=u)$. Obviously,
$\stackrel{\u02c7}{\psi}(u)=\psi (u)$.