Ruin probability in the three-seasonal discrete-time risk model

Grigutis, Andrius; Korvel, Agneška; Šiaulys, Jonas

doi:10.15559/15-VMSTA45

Modern Stochastics: Theory and Applications

Ruin probability in the three-seasonal discrete-time risk model

Volume 2, Issue 4 (2015), pp. 421–441

Andrius Grigutis ¹ Agneška Korvel Jonas Šiaulys

https://doi.org/10.15559/15-VMSTA45

Pub. online: 30 December 2015 Type: Research Article

Open Access

¹ The first author was supported by grant No. MIP-049/2014 from the Research Council of Lithuania.

Received
26 November 2015

Revised
14 December 2015

Accepted
14 December 2015

Published
30 December 2015

Abstract

This paper deals with the discrete-time risk model with nonidentically distributed claims. We suppose that the claims repeat with time periods of three units, that is, claim distributions coincide at times $\{1,4,7,\dots \}$, at times $\{2,5,8,\dots \}$, and at times $\{3,6,9,\dots \}$. We present the recursive formulas to calculate the finite-time and ultimate ruin probabilities. We illustrate the theoretical results by several numerical examples.

1 Introduction

The discrete-time risk model is a classical collective risk model for insurance. In the homogeneous version of this model, the insurer’s surplus at each time $n\in \mathbb{N}_{0}=\{0,1,2,\dots \}$ is defined by the following equality:

(1)

\[ W_{u}(n)=u+n-{\sum \limits_{i=1}^{n}}Z_{i},\]

where $u\in \mathbb{N}_{0}$ is the initial insurer’s surplus, and the claim amounts $Z_{1},Z_{2},\dots $ are assumed to be independent copies of a nonnegative integer-valued random variable Z. This random variable and the initial surplus u generate the homogeneous discrete-time risk model. A typical path of the surplus process $W_{u}(n)$ is shown in Fig. 1.

Fig. 1.

Behavior of the surplus sequence $W_{u}(n)$

The claim amount generator Z can be characterized by the probability mass function (p.m.f.)

\[ z_{k}=\mathbb{P}(Z=k),\hspace{1em}k\in \mathbb{N}_{0},\]

or by the cumulative distribution function (c.d.f.)

\[ F_{Z}(x)={\sum \limits_{k=0}^{\lfloor x\rfloor }}z_{k},\hspace{1em}x\in \mathbb{R},\]

where $\lfloor x\rfloor $ denotes the integer part of x.

The homogeneous discrete-time risk model has been extensively investigated by De Vylder and Goovaerts [5, 6], Dickson [7, 8], Gerber [10], Seal [17], Shiu [19, 18], Picard and Lefèvre [15, 16], Lefèvre and Loisel [11], Leipus and Šiaulys [12], Tang [20], and other authors. The ruin time, the ultimate ruin probability, and the finite-time ruin probability are the main extremal characteristics of any risk model. The first time $T_{u}$ when the surplus $W_{u}(n)$ becomes negative or null is called the ruin time, that is,

\[ T_{u}=\left\{\begin{array}{l}\inf \{n\in \mathbb{N}:W_{u}(n)\leqslant 0\},\hspace{1em}\\{} \infty \hspace{2.5pt}\hspace{2.5pt}\text{if}\hspace{2.5pt}W_{u}(n)>0\hspace{2.5pt}\text{for all}\hspace{2.5pt}\hspace{2.5pt}n\in \mathbb{N}.\hspace{1em}\end{array}\right.\]

The ruin probability until time $T\in \mathbb{N}$ is called the finite-time ruin probability and is defined by

\[ \psi (u,T)=\mathbb{P}(T_{u}\leqslant T).\]

The infinite-time or ultimate ruin probability is defined by

\[ \psi (u)=\mathbb{P}(T_{u}<\infty ).\]

So, for the ultimate survival probability, we have

\[ \varphi (u)=1-\psi (u)=\mathbb{P}(T_{u}=\infty ).\]

The presented definitions imply that

\[\begin{array}{r@{\hskip0pt}l}& \displaystyle \psi (u,T)=\mathbb{P}\Bigg({\bigcup \limits_{n=1}^{T}}\Bigg\{u+n-{\sum \limits_{i=1}^{n}}Z_{i}\leqslant 0\Bigg\}\Bigg)=\mathbb{P}\Bigg(\underset{1\leqslant n\leqslant T}{\max }{\sum \limits_{i=1}^{n}}(Z_{i}-1)\geqslant u\Bigg),\\{} & \displaystyle \psi (u)=\mathbb{P}\Bigg({\bigcup \limits_{n=1}^{\infty }}\Bigg\{u+n-{\sum \limits_{i=1}^{n}}Z_{i}\leqslant 0\Bigg\}\Bigg)=\mathbb{P}\Bigg(\underset{n\geqslant 1}{\sup }{\sum \limits_{i=1}^{n}}(Z_{i}-1)\geqslant u\Bigg),\\{} & \displaystyle \varphi (u)=\mathbb{P}\Bigg({\bigcap \limits_{n=1}^{\infty }}\Bigg\{u+n-{\sum \limits_{i=1}^{n}}Z_{i}>0\Bigg\}\Bigg),\\{} & \displaystyle \underset{T\nearrow \infty }{\lim }\psi (u,T)=\psi (u).\end{array}\]

Several formulas and procedures for computing finite-time ruin probability and ultimate ruin probability have been proposed in the literature. Here we present some of them having the recursive form.

• For the homogeneous discrete-time risk model, we have (see, for instance, [5, 8, 9]):
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \psi (u,1)& \displaystyle =1-F_{Z}(u),\hspace{1em}u\in \mathbb{N}_{0},\\{} \displaystyle \psi (u,T)& \displaystyle =\psi (u,1)+{\sum \limits_{k=0}^{u}}\psi (u+1-k,T-1)z_{k},\hspace{1em}\hspace{-0.1667em}u\in \mathbb{N}_{0},\hspace{1em}\hspace{-0.1667em}T\in \{2,3,\dots \}.\end{array}\]
• If model (1) is generated by the claim generator Z such that $\mathbb{E}Z<1$, then the ultimate ruin probability can be calculated by the formulas (see, for instance, [8, 9, 18]):

(2)
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \psi (0)& \displaystyle =\mathbb{E}Z,\end{array}\]

(3)
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \psi (u)& \displaystyle ={\sum \limits_{j=1}^{u-1}}\big(1-F_{Z}(j)\big)\psi (u-j)+{\sum \limits_{j=u}^{\infty }}\big(1-F_{Z}(j)\big),\hspace{1em}u\in \mathbb{N}.\end{array}\]

If the homogeneous discrete-time risk model is generated by Z satisfying condition $\mathbb{E}Z\geqslant 1$, then we say that the net profit condition does not hold, and, in such a case, we have that $\psi (u)=1$ for all $u\in \mathbb{N}_{0}$ according to the general renewal theory (see, e.g., [14] and the references therein).

The formulas presented enable us to calculate $\psi (u)$ and $\psi (u,T)$ for $u\in \mathbb{N}_{0}$ and $T\in \mathbb{N}$. Nevertheless, there exist many other methods that allow us to calculate or estimate the finite-time and the ultimate ruin probabilities. Some of them can be found in [1, 13, 16].

The assumption for claim amounts $\{Z_{1},Z_{2},\dots \}$ to be nonidentically distributed random variables is a natural generalization of the homogeneous model. If r.v.s $\{Z_{1},Z_{2},\dots \}$ are independent but not necessarily identically distributed, then the model defined by Eq. (1) is called the inhomogeneous discrete-time risk model. For such a model, a recursive procedure for calculation of finite-time ruin probabilities can be found in [2, 3]. For the finite-time ruin probabilities

\[ {\psi }^{(j)}(u,T)=\mathbb{P}\Bigg({\bigcup \limits_{n=1}^{T}}\Bigg\{u+n-{\sum \limits_{i=1}^{n}}Z_{i+j}\leqslant 0\Bigg\}\Bigg),\hspace{1em}j\in \mathbb{N}_{0},\]

we have the following theorem.

Theorem 1.

Let us consider the inhomogeneous discrete-time risk model defined by Eq. (1) in which $u\in \mathbb{N}_{0}$, ${z_{k}^{(j)}}=\mathbb{P}(Z_{1+j}=k)$, $k,j\in \mathbb{N}_{0}$, and ${F_{Z}^{(j)}}(x)=\mathbb{P}(Z_{1+j}\leqslant x)$, $x\in \mathbb{R}$. Then

\[\begin{array}{r@{\hskip0pt}l}\displaystyle {\psi }^{(j)}(u,1)& \displaystyle =1-{F_{Z}^{(j)}}(u),\\{} \displaystyle {\psi }^{(j)}(u,T)& \displaystyle ={\psi }^{(j)}(u,1)+{\sum \limits_{k=0}^{u}}{\psi }^{(j+1)}(u+1-k,T-1){z_{k}^{(j)}}\end{array}\]

for all $u\in \mathbb{N}_{0}$ and $T\in \{2,3,\dots \}$.

According to this theorem, we can calculate the finite-time ruin probability ${\psi }^{(0)}(u,T)$ of the initial model for all $u\in \mathbb{N}_{0}$ and $T\in \mathbb{N}$. Unfortunately, it is impossible to get formulas for $\psi (u)$ similar to formulas (2) and (3) in the general case because in the case of nonidentically distributed claims, the future of model behavior at each time can be completely new. In paper [4], the general discrete-time risk model was restricted to the model with two kinds of claims. In this model, there are two differently distributed claim amounts that are changing periodically. We call such a model the bi-seasonal discrete-time risk model. In [4] (see Theorem 2.3), the following statement is proved for the calculation of the ultimate ruin probability.

Theorem 2.

Let us consider a bi-seasonal discrete-time risk model generated by independent random claim amounts X and Y, that is, $Z_{2k+1}\stackrel{d}{=}X$ for $k\in \{0,1,\dots \}$ and $Z_{2k}\stackrel{d}{=}Y$ for $k\in \{1,2,\dots \}$. Denote $S=X+Y$ and $x_{n}=\mathbb{P}(X=n)$, $y_{n}=\mathbb{P}(Y=n)$, $s_{n}=\mathbb{P}(S=n)$ for $n\in \mathbb{N}_{0}=\{0,1,\dots \}$.

• If $\mathbb{E}X+\mathbb{E}Y<2$, then
\[ \underset{u\to \infty }{\lim }\psi (u)=0.\]
• If $s_{0}=x_{0}y_{0}\ne 0$, then:
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \psi (0)& \displaystyle =1-(2-\mathbb{E}S)\underset{n\to \infty }{\lim }\frac{b_{n+1}-b_{n}}{a_{n}-a_{n+1}},\\{} \displaystyle 1-\psi (u)& \displaystyle =\alpha _{u}\big(1-\psi (0)\big)+\beta _{u}(2-\mathbb{E}S),\hspace{1em}u\in \mathbb{N},\end{array}\]
where $\{\alpha _{n}\}$, $\{\beta _{n}\}$, $n\in \mathbb{N}_{0}$, are two sequences of real numbers defined recursively by formulas:
\[\begin{array}{r@{\hskip0pt}l}& \displaystyle \alpha _{0}=1,\hspace{2em}\alpha _{1}=-\frac{1}{y_{0}},\\{} & \displaystyle \alpha _{n}=\frac{1}{s_{0}}\Bigg(\alpha _{n-2}-{\sum \limits_{i=1}^{n-1}}s_{i}\alpha _{n-i}-x_{n-1}\Bigg),\hspace{1em}n\geqslant 2,\\{} & \displaystyle \beta _{0}=0,\hspace{2em}\beta _{1}=\frac{1}{y_{0}},\\{} & \displaystyle \beta _{n}=\frac{1}{s_{0}}\Bigg(\beta _{n-2}-{\sum \limits_{i=1}^{n-1}}s_{i}\beta _{n-i}+x_{n-1}\Bigg),\hspace{1em}n\geqslant 2.\end{array}\]
• If $s_{0}\ne 0$, then
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \psi (1)& \displaystyle =1-\big(1+\psi (0)-\mathbb{E}S\big)/y_{0},\\{} \displaystyle \psi (u)& \displaystyle =1+\frac{1}{s_{0}}\Bigg(\psi (u-2)-1+{\sum \limits_{k=1}^{u-1}}s_{k}\big(1-\psi (u-k)\big)\Bigg)\\{} & \displaystyle \hspace{1em}-\frac{x_{u-1}(1-\psi (1))}{x_{0}},\hspace{1em}u\in \{2,3,\dots \}.\end{array}\]
• If $x_{0}=0$, $y_{0}\ne 0$, then $s_{1}\ne 0$ and $\psi (0)=1$.
• If $x_{0}\ne 0$, $y_{0}=0$, then $s_{1}\ne 0$ and $\psi (0)=\mathbb{E}S-1$.
• If $s_{0}=0$, then, for $u\in \mathbb{N}$,
\[ \psi (u)=1-\frac{1}{s_{1}}\Bigg(1-\psi (u-1)-{\sum \limits_{k=2}^{u}}s_{k}\big(1-\psi (u-k+1)\big)\Bigg).\]

In this paper, we consider the discrete-time risk model with three seasons. We obtain a list of formulas similar to those in Theorem 2 to calculate the ultimate ruin probability in such a model. In Section 2, we present a precise definition of the three-seasonal discrete-time risk model and our main statements, whereas in Sections 3 and 4, we give detailed proofs. Finally, Section 5 deals with some numerical examples.

2 Main results

We now present the model under consideration.

Definition 1.

We say that the insurer’s surplus $W_{u}(n)$ follows the three-seasonal risk model if $W_{u}(n)$ is given by Eq. (1) for each $n\in \mathbb{N}_{0}$ and the following assumptions hold:

• the initial insurer’s surplus $u\in \mathbb{N}_{0}$,
• the random claim amounts $Z_{1},Z_{2},\dots $ are nonnegative integer-valued independent r.v.s,
• for all $k\in \mathbb{N}_{0}$, we have $Z_{3k+1}\stackrel{d}{=}Z_{1}$, $Z_{3k+2}\stackrel{d}{=}Z_{2}$, and $Z_{3k+3}\stackrel{d}{=}Z_{3}$.

Let us define p.m.f.s and p.d.f.s by the following equalities:

\[\begin{array}{r@{\hskip0pt}l}& \displaystyle a_{k}=\mathbb{P}(Z_{1}=k),\hspace{2em}b_{k}=\mathbb{P}(Z_{2}=k),\\{} & \displaystyle c_{k}=\mathbb{P}(Z_{3}=k),\hspace{2em}s_{k}=\mathbb{P}(S=k),\hspace{1em}k\in \mathbb{N}_{0},\end{array}\]

where $S=Z_{1}+Z_{2}+Z_{3}$,

\[\begin{array}{r@{\hskip0pt}l}& \displaystyle A(x)={\sum \limits_{k=0}^{\lfloor x\rfloor }}a_{k},\hspace{2em}B(x)={\sum \limits_{k=0}^{\lfloor x\rfloor }}b_{k},\\{} & \displaystyle C(x)={\sum \limits_{k=0}^{\lfloor x\rfloor }}c_{k},\hspace{2em}D(x)={\sum \limits_{k=0}^{\lfloor x\rfloor }}s_{k},\hspace{1em}x\geqslant 0.\end{array}\]

It is not difficult to see that the definitions of ruin time, finite-time ruin probability, ultimate ruin probability, and ultimate survival probability remain the same. All expressions of these quantities are the same as in the homogeneous discrete-time risk model. However, the procedures to calculate the finite-time or the ultimate probabilities are more complex than in the homogeneous or be-seasonal discrete-time risk models.

Our first result immediately follows from Theorem 1. The obtained formulas allow us to calculate the finite-time ruin probabilities $\psi (u,T)={\psi }^{(0)}(u,T)$ in the three-seasonal risk model for all $u\in \mathbb{N}_{0}$ and all $T\in \mathbb{N}$.

Theorem 3.

In the three-seasonal discrete-time risk model, for each $u\in \mathbb{N}_{0}$, we have

\[ {\psi }^{(0)}(u,1)=\sum \limits_{k>u}a_{k},\hspace{2em}{\psi }^{(1)}(u,1)=\sum \limits_{k>u}b_{k},\hspace{2em}{\psi }^{(2)}(u,1)=\sum \limits_{k>u}c_{k},\]

and for all $u\in \mathbb{N}_{0}$ and $T\in \{2,3,\dots \}$, we have the following recursive formulas:

\[\begin{array}{r@{\hskip0pt}l}\displaystyle {\psi }^{(0)}(u,T)& \displaystyle ={\psi }^{(0)}(u,1)+{\sum \limits_{k=0}^{u}}{\psi }^{(1)}(u+1-k,T-1)a_{k},\\{} \displaystyle {\psi }^{(1)}(u,T)& \displaystyle ={\psi }^{(1)}(u,1)+{\sum \limits_{k=0}^{u}}{\psi }^{(2)}(u+1-k,T-1)b_{k},\\{} \displaystyle {\psi }^{(2)}(u,T)& \displaystyle ={\psi }^{(2)}(u,1)+{\sum \limits_{k=0}^{u}}{\psi }^{(0)}(u+1-k,T-1)c_{k}.\end{array}\]

Our second result describes the meaning of the net profit condition in the three-seasonal discrete-time risk model. The proof of the theorem is presented in Section 3.

Theorem 4.

Consider the three-seasonal discrete time risk model generated by independent random claim amounts $Z_{1}$, $Z_{2}$, and $Z_{3}$. If $\mathbb{E}S>3$, then $\psi (u)=1$ for each initial surplus $u\in \mathbb{N}_{0}$. If $\mathbb{E}S=3$, then we have the following possible cases:

• $\psi (0)=\psi (1)=\psi (2)=1$ and $\psi (u)=0$ for $u\in \{3,4,\dots \}$ if $\{a_{3}=b_{0}=c_{0}=1\}$;
• $\psi (0)=\psi (1)=1$ and $\psi (u)=0$ for $u\in \{2,3,\dots \}$ if $\{a_{0}=b_{3}=c_{0}=1\}$, $\{a_{2}=b_{1}=c_{0}=1\}$, $\{a_{1}=b_{2}=c_{0}=1\},$ or $\{a_{2}=b_{0}=c_{1}=1\}$;
• $\psi (0)=1$ and $\psi (u)=0$ for all $u\in \mathbb{N}$ if $\{a_{0}=b_{0}=c_{3}=1\}$, $\{a_{0}=b_{2}=c_{1}=1\}$, $\{a_{0}=b_{1}=c_{2}=1\}$, $\{a_{1}=b_{0}=c_{2}=1\}$, or $\{a_{1}=b_{1}=c_{1}=1\}$;
• $\psi (u)=1$ for all $u\in \mathbb{N}_{0}=\{0,1,2,\dots \}$ if $s_{3}<1$.

Our last statement proposes a recursive procedure for calculation of the ultimate survival probabilities $\varphi (u)=1-\psi (u),\hspace{0.1667em}u\in \mathbb{N}_{0}$. The proof of the formulas is given in Section 4.

Theorem 5.

Consider the three-seasonal discrete-time risk model generated by independent random claim amounts $Z_{1}$, $Z_{2}$, and $Z_{3}$. Denote $S=Z_{1}+Z_{2}+Z_{3}$, $s_{n}=\mathbb{P}(S=n)$ for $n\in \mathbb{N}_{0}$, and suppose that $\mathbb{E}S<3$. Then the following statements hold.

• $\underset{u\to \infty }{\lim }\varphi (u)=1$.
• If $s_{0}\ne 0$, then

(4)
\[ \varphi (n)=\alpha _{n}\varphi (0)+\beta _{n}\varphi (1)+\gamma _{n}(3-\mathbb{E}S),\hspace{1em}n\in \mathbb{N}_{0},\]
where
\[ \left\{\begin{array}{l}\alpha _{0}=1,\hspace{2em}\alpha _{1}=0,\hspace{2em}\alpha _{2}=-\frac{1}{b_{0}c_{0}},\hspace{1em}\\{} \alpha _{n}=\frac{1}{s_{0}}(\alpha _{n-3}-{\textstyle\sum _{k=1}^{n-1}}s_{k}\alpha _{n-k}-a_{n-2}),\hspace{1em}n\geqslant 3;\hspace{1em}\end{array}\right.\]

\[ \left\{\begin{array}{l}\beta _{0}=0,\hspace{2em}\beta _{1}=1,\hspace{2em}\beta _{2}=-\frac{c_{1}}{c_{0}}-\frac{1}{b_{0}},\hspace{1em}\\{} \beta _{n}=\frac{1}{s_{0}}(\beta _{n-3}-{\textstyle\sum _{k=1}^{n-1}}s_{k}\beta _{n-k}-a_{n-2}c_{0}+c_{0}{\textstyle\sum _{k=0}^{n-1}}a_{k}b_{n-1-k}),\hspace{1em}n\geqslant 3;\hspace{1em}\end{array}\right.\]

\[ \left\{\begin{array}{l}\gamma _{0}=0,\hspace{2em}\gamma _{1}=0,\hspace{2em}\gamma _{2}=\frac{1}{b_{0}c_{0}},\hspace{1em}\\{} \gamma _{n}=\frac{1}{s_{0}}(\gamma _{n-3}-{\textstyle\sum _{k=1}^{n-1}}s_{k}\gamma _{n-k}+a_{n-2}),\hspace{1em}n\geqslant 3.\hspace{1em}\end{array}\right.\]
• If $\{a_{0}=0,b_{0}\ne 0,c_{0}\ne 0,a_{1}\ne 0\}$, then

(5)
\[ \left\{\begin{array}{l}\varphi (0)=0,\hspace{1em}\\{} \varphi (n)=\hat{\beta }_{n}\varphi (1)+\hat{\gamma }_{n}(3-\mathbb{E}S),\hspace{1em}n\in \mathbb{N},\hspace{1em}\end{array}\right.\]
where
\[ \left\{\begin{array}{l}\hat{\beta }_{1}=\beta _{1},\hspace{2em}\hat{\beta }_{2}=\beta _{2},\hspace{2em}\hat{\gamma }_{1}=\gamma _{1},\hspace{2em}\hat{\gamma }_{2}=\gamma _{2},\hspace{1em}\\{} \hat{\beta }_{n}=\frac{1}{s_{1}}(\hat{\beta }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\hat{\beta }_{n-k+1}\hspace{1em}\\{} \hspace{2em}\hspace{2.5pt}-\hspace{0.1667em}a_{n-1}c_{0}-c_{0}\varphi (1){\textstyle\sum _{k=1}^{n}}a_{k}b_{n-k}),\hspace{1em}n\geqslant 3,\hspace{1em}\\{} \hat{\gamma }_{n}=\frac{1}{s_{1}}(\hat{\gamma }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\hat{\gamma }_{n-k+1}+a_{n-1}),\hspace{1em}n\geqslant 3.\hspace{1em}\end{array}\right.\]
• If $\{a_{0}\ne 0,b_{0}=0,c_{0}\ne 0,b_{1}\ne 0\}$ then

(6)
\[ \varphi (n)=\tilde{\alpha }_{n}\varphi (0)+\tilde{\gamma }_{n}(3-\mathbb{E}S),\hspace{1em}n\in \mathbb{N},\]
where
\[ \left\{\begin{array}{l}\tilde{\alpha }_{1}=-1/c_{0},\hspace{2em}\tilde{\alpha }_{2}=c_{1}/{c_{0}^{2}}+1/(a_{0}b_{1}c_{0}),\hspace{1em}\\{} \tilde{\gamma }_{1}=1/c_{0},\hspace{2em}\tilde{\gamma }_{2}=-c_{1}/{c_{0}^{2}},\hspace{1em}\\{} \tilde{\alpha }_{n}=\frac{1}{s_{1}}(\tilde{\alpha }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\tilde{\alpha }_{n-k+1}-{\textstyle\sum _{k=0}^{n-1}}a_{k}b_{n-k}),\hspace{1em}n\geqslant 3,\hspace{1em}\\{} \tilde{\gamma }_{n}=\frac{1}{s_{1}}(\tilde{\gamma }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\tilde{\gamma }_{n-k+1}+{\textstyle\sum _{k=0}^{n-1}}a_{k}b_{n-k}),\hspace{1em}n\geqslant 3.\hspace{1em}\end{array}\right.\]
• If $\{a_{0}\ne 0,b_{0}\ne 0,c_{0}=0,c_{1}\ne 0\}$, then

(7)
\[ \varphi (n)=\breve{\alpha }_{n}\varphi (0)+\breve{\gamma }_{n}(3-\mathbb{E}S),\hspace{1em}n\in \mathbb{N}_{0},\]
where
\[ \left\{\begin{array}{l}\breve{\alpha }_{0}=1,\hspace{2em}\breve{\alpha }_{1}=-1/(b_{0}c_{1}),\hspace{2em}\breve{\gamma }_{0}=0,\hspace{2em}\breve{\gamma }_{1}=1/(b_{0}c_{1}),\hspace{1em}\\{} \breve{\alpha }_{n}=\frac{1}{s_{1}}(\breve{\alpha }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\breve{\alpha }_{n-k+1}-{\textstyle\sum _{k=0}^{n-1}}a_{k}b_{n-k}),\hspace{1em}n\geqslant 2,\hspace{1em}\\{} \breve{\gamma }_{n}=\frac{1}{s_{1}}(\breve{\gamma }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\breve{\gamma }_{n-k+1}+{\textstyle\sum _{k=0}^{n-1}}a_{k}b_{n-k}),\hspace{1em}n\geqslant 2.\hspace{1em}\end{array}\right.\]
• If $\{a_{0}=0,b_{0}=0,c_{0}\ne 0\}$, then $\varphi (0)=0$, $\varphi (1)=(3-\mathbb{E}S)/c_{0}$, and

(8)
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \varphi (u+1)& \displaystyle =\frac{1}{s_{2}}\Bigg((1-s_{3})\varphi (u)-{\sum \limits_{k=1}^{u-1}}\varphi (k)s_{u+3-k}\\{} & \displaystyle \hspace{1em}+c_{0}\varphi (1){\sum \limits_{k=0}^{u+2}}a_{k}b_{u+2-k}\Bigg),\hspace{1em}u\in \mathbb{N}.\end{array}\]
• If $\{a_{0}=0,b_{0}\ne 0,c_{0}=0\}$, then $\varphi (0)=s_{2}\varphi (1)$, $\varphi (1)=(3-\mathbb{E}S)/(s_{2}+b_{0}c_{1})$, and

(9)
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \varphi (u+1)& \displaystyle =\frac{1}{s_{2}}\Bigg((1-s_{3})\varphi (u)-{\sum \limits_{k=1}^{u-1}}\varphi (k)s_{u+3-k}\\{} & \displaystyle \hspace{1em}+a_{u+1}b_{0}c_{1}\varphi (1)\Bigg),\hspace{1em}u\in \mathbb{N}.\end{array}\]
• If $\{a_{0}\ne 0,b_{0}=0,c_{0}=0\}$, then $\varphi (0)=3-\mathbb{E}S$, $\varphi (1)=(3-\mathbb{E}S)/s_{2}$, and

(10)
\[\begin{array}{r@{\hskip10.0pt}c@{\hskip10.0pt}l}& & \displaystyle \varphi (u+1)=\frac{1}{s_{2}}\Bigg((1-s_{3})\varphi (u)+{\sum \limits_{k=1}^{u-1}}\varphi (k)s_{u+3-k}\Bigg),\hspace{1em}u\in \mathbb{N}.\end{array}\]
• If $\{a_{0}=a_{1}=0,b_{0}\ne 0,c_{0}\ne 0\}$, then $\varphi (0)=0$, $\varphi (1)=(3-\mathbb{E}S)/(1/a_{2}+c_{0})$, and the recursion formula (8) is satisfied.
• If $\{a_{0}\ne 0,b_{0}=b_{1}=0,c_{0}\ne 0\}$, then $\varphi (0)=0$, $\varphi (1)=(3-\mathbb{E}S)/c_{0}$, and the same recursion formula (8) holds.
• If $\{a_{0}\ne 0,b_{0}\ne 0,c_{0}=c_{1}=0\}$, then $\varphi (0)=3-\mathbb{E}S$, $\varphi (1)=(3-\mathbb{E}S)/s_{2}$, and the recursion formula (10) is satisfied.

We observe that all formulas presented in Theorem 5 can be used to calculate numerical values of survival or ruin probabilities for an arbitrary three-seasonal risk model and for an arbitrary initial surplus value u. The algorithms based on the derived relations work quite quickly and accurately. A few numerical examples for calculating ruin probability in the various versions of the three-seasonal risk model are presented in Section 5.

3 Net profit condition

In this section, we present a proof of Theorem 4. We recall that we denote the ultimate survival probability by $\varphi (u)$.

Proof of Theorem 4.

For an arbitrary $u\in \mathbb{N}_{0}$, we have

(11)

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \varphi (u)& \displaystyle =\mathbb{P}\Bigg({\bigcap \limits_{n=1}^{\infty }}\Bigg\{u+n-{\sum \limits_{i=1}^{n}}Z_{i}>0\Bigg\}\Bigg)\\{} & \displaystyle =\mathbb{P}\Bigg({\bigcap \limits_{n=3}^{\infty }}\Bigg\{u+n-{\sum \limits_{i=1}^{n}}Z_{i}>0\Bigg\}\cap \{Z_{1}\geqslant u+1\}\cap \{Z_{1}+Z_{2}\geqslant u+2\}\Bigg)\\{} & \displaystyle \hspace{1em}-\mathbb{P}\Bigg({\bigcap \limits_{n=3}^{\infty }}\Bigg\{u+n-{\sum \limits_{i=1}^{n}}Z_{i}>0\Bigg\}\cap \{Z_{1}\geqslant u+1\}\Bigg)\\{} & \displaystyle \hspace{1em}-\mathbb{P}\Bigg({\bigcap \limits_{n=3}^{\infty }}\Bigg\{u+n-{\sum \limits_{i=1}^{n}}Z_{i}>0\Bigg\}\cap \{Z_{1}+Z_{2}\geqslant u+2\}\Bigg)\\{} & \displaystyle \hspace{1em}+\mathbb{P}\Bigg({\bigcap \limits_{n=3}^{\infty }}\Bigg\{u+n-{\sum \limits_{i=1}^{n}}Z_{i}>0\Bigg\}\Bigg).\end{array}\]

Since the model is three-seasonal, the last probability in (11) can be expressed by the sum

(12)

\[ {\sum \limits_{k=0}^{u+2}}s_{k}\hspace{2.5pt}\mathbb{P}\Bigg({\bigcap \limits_{n=1}^{\infty }}\Bigg\{u+n+3-k-{\sum \limits_{i=1}^{n}}Z_{i}>0\Bigg\}\Bigg)={\sum \limits_{k=0}^{u+2}}s_{k}\hspace{2.5pt}\varphi (u+3-k),\]

where, as before, $s_{k}=\mathbb{P}(Z_{1}+Z_{2}+Z_{3}=k)$ for $k\in \mathbb{N}_{0}$.

The second probability in (11) is equals

(13)

\[\begin{array}{r@{\hskip0pt}l}& \displaystyle {\sum \limits_{k=u+1}^{\infty }}a_{k}\hspace{2.5pt}\mathbb{P}\Bigg(\bigcap \limits_{n\geqslant 3}\Bigg\{u+n-k-Z_{2}-Z_{3}-{\sum \limits_{i=4}^{n}}Z_{i}>0\Bigg\}\Bigg)\\{} & \displaystyle \hspace{1em}=a_{u+2}\hspace{2.5pt}\mathbb{P}(Z_{2}+Z_{3}=0)\hspace{2.5pt}\mathbb{P}\Bigg({\bigcap \limits_{n=4}^{\infty }}\Bigg\{n-2-{\sum \limits_{i=4}^{n}}Z_{i}>0\Bigg\}\Bigg)\\{} & \displaystyle \hspace{2em}+a_{u+1}\hspace{2.5pt}\mathbb{P}(Z_{2}+Z_{3}=0)\hspace{2.5pt}\mathbb{P}\Bigg({\bigcap \limits_{n=4}^{\infty }}\Bigg\{n-1-{\sum \limits_{i=4}^{n}}Z_{i}>0\Bigg\}\Bigg)\\{} & \displaystyle \hspace{2em}+a_{u+1}\hspace{2.5pt}\mathbb{P}(Z_{2}+Z_{3}=1)\hspace{2.5pt}\mathbb{P}\Bigg({\bigcap \limits_{n=4}^{\infty }}\Bigg\{n-2-{\sum \limits_{i=4}^{n}}Z_{i}>0\Bigg\}\Bigg)\\{} & \displaystyle \hspace{1em}=a_{u+2}b_{0}c_{0}\varphi (1)+a_{u+1}b_{0}c_{0}\varphi (2)+a_{u+1}b_{0}c_{1}\varphi (1)+a_{u+1}b_{1}c_{0}\varphi (1).\end{array}\]

Similarly, the third probability in (11) is

(14)

\[\begin{array}{r@{\hskip0pt}l}& \displaystyle \mathbb{P}(Z_{1}+Z_{2}=u+2)\hspace{2.5pt}\mathbb{P}(Z_{3}=0)\hspace{2.5pt}\mathbb{P}\Bigg({\bigcap \limits_{n=4}^{\infty }}\Bigg\{n-2-{\sum \limits_{i=4}^{n}}Z_{i}>0\Bigg\}\Bigg)\\{} & \displaystyle \hspace{1em}=c_{0}\varphi (1){\sum \limits_{k=0}^{u+2}}a_{k}b_{u+2-k},\end{array}\]

and, finally, the first probability in (11) is

(15)

\[\begin{array}{r@{\hskip0pt}l}& \displaystyle \mathbb{P}(Z_{1}=u+1)\hspace{2.5pt}\mathbb{P}(Z_{2}=1)\hspace{2.5pt}\mathbb{P}(Z_{3}=0)\hspace{2.5pt}\mathbb{P}\Bigg({\bigcap \limits_{n=4}^{\infty }}\Bigg\{n-2-{\sum \limits_{i=4}^{n}}Z_{i}>0\Bigg\}\Bigg)\\{} & \displaystyle \hspace{2em}+\mathbb{P}(Z_{1}=u+2)\hspace{2.5pt}\mathbb{P}(Z_{2}=0)\hspace{2.5pt}\mathbb{P}(Z_{3}=0)\hspace{2.5pt}\mathbb{P}\Bigg({\bigcap \limits_{n=4}^{\infty }}\Bigg\{n-2-{\sum \limits_{i=4}^{n}}Z_{i}>0\Bigg\}\Bigg)\\{} & \displaystyle \hspace{1em}=a_{u+1}b_{1}c_{0}\varphi (1)+a_{u+2}b_{0}c_{0}\varphi (1).\end{array}\]

Substituting (12)–(15) into (11), we get that

(16)

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \varphi (u)& \displaystyle ={\sum \limits_{k=0}^{u+2}}s_{k}\hspace{2.5pt}\varphi (u+3-k)-a_{u+1}b_{0}c_{0}\varphi (2)\\{} & \displaystyle \hspace{1em}-a_{u+1}b_{0}c_{1}\varphi (1)-c_{0}\varphi (1){\sum \limits_{k=0}^{u+2}}a_{k}b_{u+2-k}\end{array}\]

for all $u\in \mathbb{N}_{0}$.

Therefore, for $v\in \mathbb{N}_{0}$, we have

(17)

\[\begin{array}{r@{\hskip0pt}l}\displaystyle {\sum \limits_{u=0}^{v}}\varphi (u)& \displaystyle ={\sum \limits_{u=0}^{v}}{\sum \limits_{k=0}^{u+2}}s_{k}\varphi (u+3-k)\\{} & \displaystyle \hspace{1em}-b_{0}c_{0}\varphi (2)\big(A(v+1)-a_{0}\big)-b_{0}c_{1}\varphi (1)\big(A(v+1)-a_{0}\big)\\{} & \displaystyle \hspace{1em}-c_{0}\varphi (1){\sum \limits_{u=0}^{v}}{\sum \limits_{k=0}^{u+2}}a_{k}b_{u+2-k}.\end{array}\]

We observe that the sum

\[ {\sum \limits_{u=0}^{v}}{\sum \limits_{k=0}^{u+2}}a_{k}b_{u+2-k}\]

can be rewritten in the form

(18)

\[\begin{array}{r@{\hskip0pt}l}& \displaystyle a_{0}{\sum \limits_{u=0}^{v}}b_{u+2}+a_{1}{\sum \limits_{u=0}^{v}}b_{u+1}+a_{2}{\sum \limits_{u=0}^{v}}b_{u}+{\sum \limits_{k=3}^{v+2}}a_{k}{\sum \limits_{u=k-2}^{v}}b_{u+2-k}\\{} & \displaystyle \hspace{1em}=a_{0}\big(B(v+2)-b_{0}-b_{1}\big)+a_{1}\big(B(v+1)-b_{0}\big)+a_{2}B(v)\\{} & \displaystyle \hspace{2em}+{\sum \limits_{k=3}^{v+2}}a_{k}B(v+2-k)\\{} & \displaystyle \hspace{1em}={\sum \limits_{k=0}^{v+2}}a_{k}B(v+2-k)-a_{0}b_{0}-a_{0}b_{1}-a_{1}b_{0}.\end{array}\]

Similarly, the sum

\[ {\sum \limits_{u=0}^{v}}{\sum \limits_{k=0}^{u+2}}s_{k}\varphi (u+3-k)\]

equals

(19)

\[\begin{array}{r@{\hskip0pt}l}& \displaystyle {\sum \limits_{k=1}^{v+3}}\varphi (k)D(v+3-k)-s_{0}\varphi (1)-s_{1}\varphi (1)-s_{0}\varphi (2),\end{array}\]

where

\[ D(x)={\sum \limits_{k=0}^{\lfloor x\rfloor }}s_{k}={\sum \limits_{k=0}^{\lfloor x\rfloor }}\mathbb{P}(Z_{1}+Z_{2}+Z_{3}=k).\]

Relations (17), (18), and (19) imply that

\[\begin{array}{r@{\hskip0pt}l}\displaystyle {\sum \limits_{k=0}^{v}}\varphi (k)& \displaystyle ={\sum \limits_{k=1}^{v+3}}\varphi (k)D(v+3-k)\\{} & \displaystyle \hspace{1em}-b_{0}c_{0}\varphi (2)A(v+1)-b_{0}c_{1}\varphi (1)A(v+1)\\{} & \displaystyle \hspace{1em}-c_{0}\varphi (1){\sum \limits_{k=0}^{v+2}}a_{k}B(v+2-k)\end{array}\]

or, equivalently,

(20)

\[\begin{array}{r@{\hskip0pt}l}& \displaystyle {\sum \limits_{k=0}^{v+3}}\varphi (k)\big(1-D(v+3-k)\big)\\{} & \displaystyle \hspace{1em}=\varphi (v+1)+\varphi (v+2)+\varphi (v+3)-\varphi (0)D(v+3)-b_{0}c_{0}\varphi (2)A(v+1)\\{} & \displaystyle \hspace{2em}-b_{0}c_{1}\varphi (1)A(v+1)+c_{0}\varphi (1)\Bigg({\sum \limits_{k=0}^{v+2}}a_{k}\overline{B}(v+2-k)+A(v+2)\Bigg).\end{array}\]

For each $K\in [1,v+2),$ we have

\[ {\sum \limits_{k=0}^{v+2}}a_{k}\overline{B}(v+2-k)={\sum \limits_{k=0}^{K}}a_{k}\overline{B}(v+2-k)+{\sum \limits_{k=K+1}^{v+2}}a_{k}\overline{B}(v+2-k).\]

Therefore,

\[ \underset{v\to \infty }{\limsup }{\sum \limits_{k=0}^{v+2}}a_{k}\overline{B}(v+2-k)\leqslant {\sum \limits_{k=K+1}^{\infty }}a_{k}\]

for each $K\geqslant 1$, and so

(21)

\[ \underset{v\to \infty }{\lim }{\sum \limits_{k=0}^{v+2}}a_{k}\overline{B}(v+2-k)=0.\]

The sequence $\varphi (u),u\in \mathbb{N}_{0}$, is bounded and nondecreasing. So, the limit $\varphi (\infty ):=\underset{u\to \infty }{\lim }\varphi (u).$ Similarly to the derivation of (21), we can get that

\[ \underset{v\to \infty }{\limsup }{\sum \limits_{k=0}^{v+3}}\big(\varphi (\infty )-\varphi (k)\big)\big(1-D(v+3-k)\big)\leqslant \underset{k\geqslant K+1}{\sup }\big(\varphi (\infty )-\varphi (k)\big)\mathbb{E}S\]

for each fixed $K\geqslant 1$. Therefore,

(22)

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \underset{v\to \infty }{\lim }{\sum \limits_{k=0}^{v+3}}\varphi (k)\big(1-D(v+3-k)\big)& \displaystyle =\varphi (\infty )\underset{v\to \infty }{\lim }{\sum \limits_{k=0}^{v+3}}\big(1-D(k)\big)\\{} & \displaystyle =\varphi (\infty )\mathbb{E}S.\end{array}\]

Relations (20), (21), and (22) imply that

(23)

\[ \varphi (\infty )(3-\mathbb{E}S)=\varphi (0)+b_{0}c_{0}\varphi (2)+b_{0}c_{1}\varphi (1)+c_{0}\varphi (1).\]

Now we consider the last equality and examine all possible cases.

(I) If $\mathbb{E}S>3$, then (23) implies that $\varphi (\infty )=0$ because the left side of (23) is nonnegative in all cases. So, in this case, $\psi (u)=1$ for all $u\in \{0,1,2,\dots \}$.
(II) If $\mathbb{E}S=3$, then (23) implies that
\[ \varphi (0)+b_{0}c_{0}\varphi (2)+b_{0}c_{1}\varphi (1)+c_{0}\varphi (1)=0.\]
Additionally, in this situation we have that $s_{3}=1$ or $s_{3}<1$.
(II-A) If $s_{3}=1$, then we have
\[ \left\{\begin{array}{l}a_{0}b_{0}c_{0}=0,\hspace{1em}\\{} a_{1}b_{0}c_{0}+a_{0}b_{1}c_{0}+a_{0}b_{0}c_{1}=0,\hspace{1em}\\{} a_{0}b_{0}c_{2}+a_{0}b_{2}c_{0}+a_{2}b_{0}c_{0}+a_{1}b_{1}c_{0}+a_{0}b_{1}c_{1}+a_{1}b_{0}c_{1}=0,\hspace{1em}\\{} a_{0}b_{0}c_{3}+a_{0}b_{3}c_{0}+a_{3}b_{0}c_{0}+a_{1}b_{2}c_{0}+a_{2}b_{1}c_{0}\hspace{1em}\\{} \hspace{30.0pt}+a_{0}b_{1}c_{2}+a_{0}b_{2}c_{1}+a_{1}b_{0}c_{2}+a_{2}b_{0}c_{1}+a_{1}b_{1}c_{1}=1,\hspace{1em}\\{} \varphi (0)+b_{0}c_{0}\varphi (2)+b_{0}c_{1}\varphi (1)+c_{0}\varphi (1)=0.\hspace{1em}\end{array}\right.\]

Taking into account that all numbers $a_{k}$, $b_{k}$, and $c_{k}$ are local probabilities for all $k\in \mathbb{N}_{0}$, the last system implies the following possible cases.

(a) $\{a_{3}=b_{0}=c_{0}=1\}$ and $\varphi (0)=\varphi (1)=\varphi (2)=0$. In this case, $\psi (0)=\psi (1)=\psi (2)=1$ and $\psi (u)=0,u\in \{3,4,\dots \}$ because
\[ W_{u}(n)=\left\{\begin{array}{l@{\hskip10.0pt}l}u-2\hspace{1em}& \hspace{2.5pt}\text{if}\hspace{2.5pt}\hspace{2.5pt}n\equiv 1\hspace{2.5pt}\text{mod}\hspace{2.5pt}3,\\{} u-1\hspace{1em}& \hspace{2.5pt}\text{if}\hspace{2.5pt}\hspace{2.5pt}n\equiv 2\hspace{2.5pt}\text{mod}\hspace{2.5pt}3,\\{} u\hspace{1em}& \hspace{2.5pt}\text{if}\hspace{2.5pt}\hspace{2.5pt}n\equiv 0\hspace{2.5pt}\text{mod}\hspace{2.5pt}3.\end{array}\right.\]
(b) $\{a_{0}=b_{3}=c_{0}=1\}$ and $\varphi (0)=\varphi (1)=0$. In this case, $\psi (0)=\psi (1)=1$ and $\psi (u)=0$ for $u\in \{2,3,\dots \}$ because
\[ W_{u}(n)=\left\{\begin{array}{l@{\hskip10.0pt}l}u+1\hspace{1em}& \hspace{2.5pt}\text{if}\hspace{2.5pt}\hspace{2.5pt}n\equiv 1\hspace{2.5pt}\text{mod}\hspace{2.5pt}3,\\{} u-1\hspace{1em}& \hspace{2.5pt}\text{if}\hspace{2.5pt}\hspace{2.5pt}n\equiv 2\hspace{2.5pt}\text{mod}\hspace{2.5pt}3,\\{} u\hspace{1em}& \hspace{2.5pt}\text{if}\hspace{2.5pt}\hspace{2.5pt}n\equiv 0\hspace{2.5pt}\text{mod}\hspace{2.5pt}3.\end{array}\right.\]
(c) $\{a_{0}=b_{0}=c_{3}=1\}$ and $\varphi (0)=0$. In this case, $\psi (0)=1$ and $\psi (u)=0$ for $u\in \{1,2,\dots \}$ because
\[ W_{u}(n)=\left\{\begin{array}{l@{\hskip10.0pt}l}u+1\hspace{1em}& \hspace{2.5pt}\text{if}\hspace{2.5pt}\hspace{2.5pt}n\equiv 1\hspace{2.5pt}\text{mod}\hspace{2.5pt}3,\\{} u+2\hspace{1em}& \hspace{2.5pt}\text{if}\hspace{2.5pt}\hspace{2.5pt}n\equiv 2\hspace{2.5pt}\text{mod}\hspace{2.5pt}3,\\{} u\hspace{1em}& \hspace{2.5pt}\text{if}\hspace{2.5pt}\hspace{2.5pt}n\equiv 0\hspace{2.5pt}\text{mod}\hspace{2.5pt}3.\end{array}\right.\]
(d) $\{a_{2}=b_{1}=c_{0}=1\}$ and $\varphi (0)=\varphi (1)=0$. In this case, $\psi (0)=\psi (1)=1$ and $\psi (u)=0$ for $u\in \{2,3,\dots \}$.
(e) $\{a_{1}=b_{2}=c_{0}=1\}$ and $\varphi (0)=\varphi (1)=0$. In this case, $\psi (0)=\psi (1)=1$ and $\psi (u)=0$ for $u\in \{2,3,\dots \}$.
(f) $\{a_{0}=b_{2}=c_{1}=1\}$ and $\varphi (0)=0$. In this case, $\psi (0)=1$ and $\psi (u)=0$ for $u\in \{1,2,\dots \}$.
(g) $\{a_{0}=b_{1}=c_{2}=1\}$ and $\varphi (0)=0$. In this case, $\psi (0)=1$ and $\psi (u)=0$ for $u\in \{1,2,\dots \}$.
(h) $\{a_{2}=b_{0}=c_{1}=1\}$ and $\varphi (0)=\varphi (1)=0$. In this case, $\psi (0)=\psi (1)=1$ and $\psi (u)=0$ for $u\in \{2,3,\dots \}$.
(i) $\{a_{1}=b_{0}=c_{2}=1\}$ and $\varphi (0)=0$. In this case, $\psi (0)=1$ and $\psi (u)=0$ for $u\in \{1,2,\dots \}$.
(j) $\{a_{1}=b_{1}=c_{1}=1\}$ and $\varphi (0)=0$. In this case, $\psi (0)=1$ and $\psi (u)=0$ for $u\in \{1,2,\dots \}$.
(II-B) If $s_{3}<1$ and $\mathbb{E}S=3$, then it is necessary that $s_{0}\ne 0$ or $s_{1}\ne 0$ or $s_{2}\ne 0$ because, on the contrary, $\mathbb{E}S=3s_{3}+4s_{4}+5s_{5}+\cdots >3(s_{3}+s_{4}+\cdots \hspace{0.1667em})=3$. In this situation, it suffices to consider the following cases:
\[ \{s_{0}\ne 0\},\hspace{2em}\{s_{0}=0,s_{1}\ne 0\},\hspace{2em}\{s_{0}=0,s_{1}=0,s_{2}\ne 0\}.\]
(k) If $s_{0}=a_{0}b_{0}c_{0}\ne 0$, then (23) implies that $\varphi (0)=\varphi (1)=\varphi (2)=0$, and from (16) we obtain $\varphi (u)=0$ for all $u\in \{3,4,\dots \}$. So, $\psi (u)=1$ if $u\in \{0,1,\dots \}$ in this case.
(l) If $s_{0}=a_{0}b_{0}c_{0}=0$ and $s_{1}=a_{0}b_{0}c_{1}+a_{0}b_{1}c_{0}+a_{1}b_{0}c_{0}\ne 0,$ then we have the following possible cases.
(l-1) $\{a_{0}=0$, $a_{1}\ne 0$, $b_{0}\ne 0$, $c_{0}\ne 0\}$. In this situation, Eq. (23) implies that $\varphi (0)=\varphi (1)=\varphi (2)=0$, whereas (16) implies that $\varphi (u)=0$ for all $u\in \{3,4,\dots \}$. So, $\psi (u)=1$ for all $u\in \{0,1,\dots \}$ in this case.
(l-2) $\{a_{0}\ne 0$, $b_{0}=0$, $b_{1}\ne 0$, $c_{0}\ne 0\}$. In this situation, Eq. (23) implies that $\varphi (0)=\varphi (1)=0$, and (16) implies that $\varphi (u)=0$ for all $u\in \{2,3,\dots \}$. Therefore, $\psi (u)=1$ for all $u\in \{0,1,\dots \}$ again.
(l-3) $\{a_{0}\ne 0$, $b_{0}\ne 0$, $c_{0}=0$, $c_{1}\ne 0\}$.

Equality (23) implies that $\varphi (0)=\varphi (1)=0$, and (16) implies that $\varphi (u)=0$ for all $u\in \{2,3,\dots \}$. So, in this case, $\psi (u)=1$ for all $u\in \{0,1,\dots \}$.
(m) If $s_{0}=a_{0}b_{0}c_{0}=0$, $s_{1}=a_{0}b_{0}c_{1}+a_{0}b_{1}c_{0}+a_{1}b_{0}c_{0}=0$ and $s_{2}=a_{0}b_{0}c_{2}+a_{0}b_{2}c_{0}+a_{2}b_{0}c_{0}+a_{1}b_{1}c_{0}+a_{1}b_{0}c_{1}+a_{0}b_{1}c_{1}\ne 0$, then there exist the following possible cases.
(m-1) $\{a_{0}=0$, $a_{1}=0$, $a_{2}\ne 0$, $b_{0}\ne 0$, $c_{0}\ne 0\}$;
(m-2) $\{a_{0}\ne 0$, $b_{0}=0$, $b_{1}=0$, $b_{2}\ne 0$, $c_{0}\ne 0\}$;
(m-3) $\{a_{0}\ne 0$, $b_{0}\ne 0$, $c_{0}=0$, $c_{1}=0$, $c_{2}\ne 0\}$;
(m-4) $\{a_{0}=0$, $a_{1}\ne 0$, $b_{0}=0$, $b_{1}\ne 0$, $c_{0}\ne 0\}$;
(m-5) $\{a_{0}=0$, $a_{1}\ne 0$, $b_{0}\ne 0$, $c_{0}=0$, $c_{1}\ne 0\}$;
(m-6) $\{a_{0}\ne 0$, $b_{0}=0$, $b_{1}\ne 0$, $c_{0}=0$, $c_{1}\ne 0\}$.

In all cases, Eqs. (23) and (16) imply that $\varphi (u)=0,$ and so $\psi (u)=1$ for all $u\in \mathbb{N}_{0}$. Theorem 4 is proved. □

4 Recursive formulas

In this section, we prove Theorem 5. Equality (23) from the previous section plays a crucial role.

Proof of Theorem 5.

Let we consider the case $\mathbb{E}S<3$. First, we prove that $\varphi (\infty )=1$. According to the definition

\[ \varphi (\infty )=\underset{u\to \infty }{\lim }\mathbb{P}\Bigg({\bigcap \limits_{n=1}^{\infty }}\Bigg\{{\sum \limits_{i=1}^{n}}(Z_{i}-1)<u\Bigg\}\Bigg)=\underset{u\to \infty }{\lim }\mathbb{P}\Big(\underset{u\geqslant 1}{\sup }\eta _{n}<u\Big),\]

where

\[ \eta _{n}={\sum \limits_{i=1}^{n}}(Z_{i}-1),\hspace{1em}n\in \mathbb{N}.\]

If $n=3N$, $N\in \mathbb{N}$, then

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \frac{\eta _{n}}{n}=\frac{\eta _{3N}}{3N}& \displaystyle =\frac{1}{3}\Bigg(\frac{1}{N}{\sum \limits_{i=1}^{N}}(Z_{3i-2}-1)+\frac{1}{N}{\sum \limits_{i=1}^{N}}(Z_{3i-1}-1)+\frac{1}{N}{\sum \limits_{i=1}^{N}}(Z_{3i}-1)\Bigg).\end{array}\]

If $n=3N+1$, $N\in \mathbb{N}$, then

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \frac{\eta _{n}}{n}=\frac{\eta _{3N+1}}{3N+1}& \displaystyle =\frac{N+1}{3N+1}\hspace{2.5pt}\frac{1}{N+1}{\sum \limits_{i=1}^{N+1}}(Z_{3i-2}-1)\\{} & \displaystyle \hspace{1em}+\frac{N}{3N+1}\Bigg(\frac{1}{N}{\sum \limits_{i=1}^{N}}(Z_{3i-1}-1)+\frac{1}{N}{\sum \limits_{i=1}^{N}}(Z_{3i}-1)\Bigg).\end{array}\]

If $n=3N+2$, $N\in \mathbb{N}$, then

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \frac{\eta _{n}}{n}=\frac{\eta _{3N+2}}{3N+2}& \displaystyle =\frac{N}{3N+2}\hspace{2.5pt}\frac{1}{N}{\sum \limits_{i=1}^{N}}(Z_{3i}-1)\\{} & \displaystyle \hspace{1em}+\frac{N+1}{3N+2}\Bigg(\frac{1}{N+1}{\sum \limits_{i=1}^{N+1}}(Z_{3i-2}-1)+\frac{1}{N+1}{\sum \limits_{i=1}^{N+1}}(Z_{3i-1}-1)\Bigg).\end{array}\]

Hence, the strong law of large numbers implies that

\[ \frac{\eta _{n}}{n}\underset{n\to \infty }{\to }\frac{1}{3}(\mathbb{E}Z_{1}-1+\mathbb{E}Z_{2}-1+\mathbb{E}Z_{3}-1)=\frac{\mathbb{E}S-3}{3}\]

almost surely.

From this it follows that

(24)

\[ \mathbb{P}\bigg(\underset{m\geqslant n}{\sup }\Big|\frac{\eta _{m}}{m}+\mu \Big|<\frac{\mu }{2}\bigg)\underset{n\to \infty }{\to }\hspace{2.5pt}1\]

with $\mu :=(\mathbb{E}S-3)/3>0$.

For arbitrary positive u and $N\in \mathbb{N}$, we have

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \mathbb{P}\Big(\underset{n\geqslant 1}{\sup }\eta _{n}<u\Big)& \displaystyle \geqslant \mathbb{P}\Bigg(\Bigg({\bigcap \limits_{n=1}^{N}}\bigg\{\eta _{n}\leqslant \frac{u}{2}\bigg\}\Bigg)\cap \Bigg({\bigcap \limits_{n=N+1}^{\infty }}\bigg\{\eta _{n}\leqslant \frac{u}{2}\bigg\}\Bigg)\Bigg)\\{} & \displaystyle \geqslant \mathbb{P}\Bigg({\bigcap \limits_{n=1}^{N}}\bigg\{\eta _{n}\leqslant \frac{u}{2}\bigg\}\Bigg)+\mathbb{P}\Bigg({\bigcap \limits_{n=N+1}^{\infty }}\{\eta _{n}\leqslant 0\}\Bigg)-1\\{} & \displaystyle \geqslant \mathbb{P}\Bigg({\bigcap \limits_{n=1}^{N}}\bigg\{\eta _{n}\leqslant \frac{u}{2}\bigg\}\Bigg)+\mathbb{P}\bigg(\underset{m\geqslant N+1}{\sup }\Big|\frac{\eta _{m}}{m}+\mu \Big|<\frac{\mu }{2}\bigg)-1.\end{array}\]

The last inequality implies that

\[ \underset{u\to \infty }{\lim }\mathbb{P}\Big(\underset{n\geqslant 1}{\sup }\eta _{n}<u\Big)\geqslant \mathbb{P}\bigg(\underset{m\geqslant N+1}{\sup }\Big|\frac{\eta _{m}}{m}+\mu \Big|<\frac{\mu }{2}\bigg)\]

for arbitrary $N\in \mathbb{N}$.

Hence, according to (24), we have that $\varphi (\infty )=1$.

Substituting this into (23), we get

(25)

\[ 3-\mathbb{E}S=\varphi (0)+b_{0}c_{0}\varphi (2)+b_{0}c_{1}\varphi (1)+c_{0}\varphi (1).\]

In addition, Eq. (16) can be rewritten as follows:

(26)

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \varphi (u)& \displaystyle ={\sum \limits_{k=0}^{u+2}}s_{u+2-k}\hspace{2.5pt}\varphi (k+1)-a_{u+1}b_{0}c_{0}\varphi (2)-a_{u+1}b_{0}c_{1}\varphi (1)\\{} & \displaystyle \hspace{1em}-c_{0}\varphi (1){\sum \limits_{k=0}^{u+2}}a_{k}b_{u+2-k},\hspace{1em}u\in \mathbb{N}_{0}.\end{array}\]

Now we consider the last two formulas to get a suitable recursion procedure described in Theorem 5.

• First, let $s_{0}=a_{0}b_{0}c_{0}\ne 0$, and let the sequences $\alpha _{n}$, $\beta _{n}$, $\gamma _{n}$ be defined in the statement of Theorem 5.

We prove (4) by induction. We observe that relation (25) implies immediately:

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \varphi (0)& \displaystyle =\alpha _{0}\varphi (0)+\beta _{0}\varphi (1)+\gamma _{0}(3-\mathbb{E}S),\\{} \displaystyle \varphi (1)& \displaystyle =\alpha _{1}\varphi (0)+\beta _{1}\varphi (1)+\gamma _{1}(3-\mathbb{E}S),\\{} \displaystyle \varphi (2)& \displaystyle =\alpha _{2}\varphi (0)+\beta _{2}\varphi (1)+\gamma _{2}(3-\mathbb{E}S).\end{array}\]

Now suppose that Eq. (4) holds for all $n=0,1,\dots ,N-1$, and we will prove that (4) holds for $n=N$. By (26) we have

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \varphi (N-3)& \displaystyle ={\sum \limits_{k=0}^{N-1}}s_{N-1-k}\hspace{2.5pt}\varphi (k+1)-a_{N-2}b_{0}c_{0}\varphi (2)-a_{N-2}b_{0}c_{1}\varphi (1)\\{} & \displaystyle \hspace{1em}-c_{0}\varphi (1){\sum \limits_{k=0}^{N-1}}a_{k}b_{N-1-k}.\end{array}\]

Therefore, using the induction hypothesis, we get

(27)

\[\begin{array}{r@{\hskip0pt}l}\displaystyle s_{0}\varphi (N)& \displaystyle =\varphi (N-3)-{\sum \limits_{k=1}^{N-1}}s_{k}\varphi (N-k)+a_{N-2}b_{0}c_{0}\varphi (2)\\{} & \displaystyle \hspace{1em}+a_{N-2}b_{0}c_{1}\varphi (1)+c_{0}\varphi (1){\sum \limits_{k=0}^{N-1}}a_{k}b_{N-1-k}\\{} & \displaystyle =\alpha _{N-3}\varphi (0)+\beta _{N-3}\varphi (1)+\gamma _{N-3}(3-\mathbb{E}S)\\{} & \displaystyle \hspace{1em}-{\sum \limits_{k=1}^{N-1}}s_{k}\big(\alpha _{N-k}\varphi (0)+\beta _{N-k}\varphi (1)\\{} & \displaystyle \hspace{1em}+\gamma _{N-k}(3-\mathbb{E}S)\big)+a_{N-2}b_{0}c_{0}\varphi (2)+a_{N-2}b_{0}c_{1}\varphi (1)\\{} & \displaystyle \hspace{1em}+c_{0}\varphi (1){\sum \limits_{k=0}^{N-1}}a_{k}b_{N-1-k}.\end{array}\]

Since

\[ \varphi (2)=-\frac{1}{b_{0}c_{0}}\varphi (0)-\frac{c_{1}}{c_{0}}\varphi (1)-\frac{1}{b_{0}}\varphi (1)+\frac{3-\mathbb{E}S}{b_{0}c_{0}}\]

due to (25), we obtain from (27) that

\[\begin{array}{r@{\hskip0pt}l}\displaystyle \varphi (N)& \displaystyle =\varphi (0)\hspace{2.5pt}\frac{1}{s_{0}}\Bigg(\alpha _{N-3}-{\sum \limits_{k=1}^{N-1}}s_{k}\alpha _{N-k}-a_{N-2}\Bigg)\\{} & \displaystyle \hspace{1em}+\varphi (1)\hspace{2.5pt}\frac{1}{s_{0}}\Bigg(\beta _{N-3}-{\sum \limits_{k=1}^{N-1}}s_{k}\beta _{N-k}-a_{N-2}c_{0}+c_{0}{\sum \limits_{k=0}^{N-1}}a_{k}b_{N-1-k}\Bigg)\\{} & \displaystyle \hspace{1em}+(3-\mathbb{E}S)\hspace{2.5pt}\frac{1}{s_{0}}\Bigg(\gamma _{N-3}-{\sum \limits_{k=1}^{N-1}}s_{k}\gamma _{N-k}+a_{N-2}\Bigg)\\{} & \displaystyle =\alpha _{N}\varphi (0)+\beta _{N}\varphi (1)+\gamma _{N}(3-\mathbb{E}S).\end{array}\]

Hence, the desired relation (4) holds for all $n\in \mathbb{N}_{0}$ by induction.

• If $\{a_{0}=0,b_{0}\ne 0,c_{0}\ne 0,a_{1}\ne 0\},$ then $s_{0}=0$ and $s_{1}\ne 0$. Equality (26) with $u=0$ implies that $\varphi (0)=0$. The recursive relation (5) can be derived from the basic equalities (25) and (26) in the same manner as relation (4).
• If $\{a_{0}\ne 0,b_{0}=0,c_{0}\ne 0,b_{1}\ne 0\},$ then it follows from Eq. (25) that $3-\mathbb{E}S=\varphi (0)+c_{0}\varphi (1).$ Hence, $\varphi (1)=\tilde{\alpha }_{1}\varphi (0)+\tilde{\gamma }_{1}(3-\mathbb{E}S)$. This is Eq. (6) for $n=1$. The validity of (6) for the other n can be derived from (26) using the induction arguments.
• In the case $\{a_{0}\ne 0,b_{0}\ne 0,c_{0}=0,c_{1}\ne 0\}$, formula (7) follows from (25) if $n=1$. For the other n, formula (7) follows from (26) again by using the induction arguments.
• In the case $\{a_{0}=0,b_{0}=0,c_{0}\ne 0\}$, we have that $s_{0}=s_{1}=0$ and $s_{2}\ne 0$ because of $\mathbb{E}S<3$. It follows immediately from (26) that $\varphi (0)=0$, whereas from (25) it follows that $\varphi (1)=(3-\mathbb{E}S)/s_{2}$. Finally, we can get the recursive formula (8) from (26) using the same induction procedure.
• In the case $\{a_{0}=0,b_{0}\ne 0,c_{0}=0\}$, similarly as in the previous one, we derive that $\varphi (0)=s_{2}\varphi (1)$ from (26), we derive that $3-\mathbb{E}S=\varphi (0)+b_{0}c_{1}\varphi (1)$ from (25), and we derive the desired formula (9) again from (26).
• The case $\{a_{0}\ne 0,b_{0}=0,c_{0}=0\}$ is considered completely analogously as both previous cases. Here we omit details.

We have that $\mathbb{E}S<3$. So, it remains to study the following possible cases:

\[\begin{array}{r@{\hskip0pt}l}& \displaystyle \{a_{0}=a_{1}=0,b_{0}\ne 0,c_{0}\ne 0\},\hspace{2em}\{a_{0}\ne 0,b_{0}=b_{1}=0,c_{0}\ne 0\},\\{} & \displaystyle \{a_{0}\ne 0,b_{0}\ne 0,c_{0}=c_{1}=0\}.\end{array}\]

In all these cases, the presented recursion relations follow from Eq. (26), and the initial values of survival probability $\varphi (0)$ and $\varphi (1)$ can be obtained using Eq. (25) together with Eq. (26) with $u=0$ or $u=1$. Theorem 5 is proved. □

5 Numerical examples

In this section, we present three examples of computing numerical values of the finite-time ruin probability and the ultimate ruin probability. All calculations are carried out using software MATHEMATICA. In all presented tables, the numbers are rounded up to three decimal places.

First example. Suppose that the three-seasonal discrete-time risk model is generated by the r.v.s

\[ \begin{array}{c|c|c|c}Z_{1}& 0& 1& 2\\ \hline \mathbb{P}& 0.5& 0.25& 0.25\end{array},\hspace{2em}\begin{array}{c|c|c|c}Z_{2}& 0& 1& 2\\ \hline \mathbb{P}& 0.4& 0.3& 0.3\end{array},\hspace{2em}\begin{array}{c|c|c|c}Z_{3}& 0& 1& 2\\ \hline \mathbb{P}& 0.3& 0.35& 0.35\end{array}.\]

In Table 1, we give the finite-time ruin probabilities for initial surpluses $u\in \{0,1,\dots 10,20\}$ and times $T\in \{1,2,\dots ,10,20\}$ together with the ultimate ruin probabilities for the same u.

Table 1.

Ruin probabilities for the first model

T	u
	0	1	2	3	4	5	6	7	8	9	10	20
1	0.5	0.25	0	0	0	0	0	0	0	0	0	0
2	0.65	0.325	0.075	0	0	0	0	0	0	0	0	0
3	0.703	0.404	0.128	0.026	0	0	0	0	0	0	0	0
4	0.733	0.445	0.169	0.046	0.007	0	0	0	0	0	0	0
5	0.751	0.475	0.2	0.066	0.014	0.002	0	0	0	0	0	0
6	0.768	0.503	0.233	0.089	0.026	0.005	0.001	0	0	0	0	0
7	0.779	0.523	0.256	0.106	0.035	0.009	0.002	0	0	0	0	0
8	0.788	0.538	0.275	0.122	0.045	0.014	0.003	0.001	0	0	0	0
9	0.796	0.554	0.295	0.139	0.056	0.019	0.006	0.001	0	0	0	0
10	0.802	0.566	0.310	0.152	0.065	0.024	0.008	0.002	0	0	0	0
20	0.836	0.632	0.402	0.243	0.138	0.075	0.038	0.018	0.008	0.003	0.001	0
∞	0.877	0.722	0.541	0.404	0.301	0.224	0.167	0.125	0.093	0.069	0.052	0.003

Table 2.

Ruin probabilities for the Poison model

T	u
	0	1	2	3	4	5	6	7	8	9	10	20
1	0.393	0.09	0.014	0.002	0	0	0	0	0	0	0	0
2	0.481	0.152	0.037	0.008	0.001	0	0	0	0	0	0	0
3	0.535	0.205	0.066	0.019	0.005	0.001	0	0	0	0	0	0
4	0.549	0.221	0.075	0.023	0.006	0.002	0	0	0	0	0	0
5	0.562	0.236	0.086	0.028	0.009	0.002	0.001	0	0	0	0	0
6	0.576	0.254	0.099	0.036	0.012	0.004	0.001	0	0	0	0	0
7	0.581	0.26	0.103	0.038	0.013	0.004	0.001	0	0	0	0	0
8	0.585	0.266	0.109	0.042	0.015	0.005	0.002	0.001	0	0	0	0
9	0.591	0.274	0.115	0.046	0.017	0.006	0.002	0.001	0	0	0	0
10	0.593	0.277	0.118	0.048	0.018	0.007	0.002	0.001	0	0	0	0
20	0.605	0.295	0.134	0.059	0.026	0.011	0.005	0.002	0.001	0.0003	0.0001	0
∞	0.609	0.3	0.139	0.064	0.029	0.013	0.006	0.003	0.001	0.001	0.0002	0

Table 3.

Ruin probabilities for the geometric model

T	u
	0	1	2	3	4	5	6	7	8	9	10	20
1	0.25	0.063	0.016	0.004	0.001	0	0	0	0	0	0	0
2	0.333	0.111	0.037	0.012	0.004	0.001	0	0	0	0	0	0
3	0.556	0.34	0.218	0.143	0.094	0.063	0.042	0.028	0.019	0.012	0.008	0
4	0.566	0.35	0.226	0.149	0.099	0.066	0.044	0.029	0.019	0.013	0.009	0
5	0.576	0.362	0.236	0.156	0.104	0.069	0.046	0.031	0.021	0.014	0.009	0
6	0.653	0.461	0.334	0.243	0.176	0.127	0.091	0.065	0.046	0.033	0.023	0.001
7	0.657	0.466	0.338	0.247	0.18	0.13	0.093	0.067	0.048	0.034	0.024	0.001
8	0.661	0.471	0.344	0.252	0.184	0.133	0.096	0.069	0.049	0.035	0.025	0.001
9	0.703	0.529	0.406	0.312	0.239	0.181	0.137	0.102	0.076	0.056	0.042	0.002
10	0.705	0.532	0.409	0.315	0.241	0.184	0.139	0.104	0.078	0.057	0.042	0.002
20	0.774	0.635	0.528	0.438	0.363	0.298	0.243	0.197	0.159	0.127	0.101	0.008
∞	0.927	0.879	0.84	0.803	0.769	0.736	0.705	0.675	0.647	0.619	0.593	0.385

Numerical values of the finite-time ruin probabilities are calculated using the algorithm presented in Theorem 3, whereas the values of the ultimate ruin probabilities are obtained using the formulas of Theorem 5. Namely, first, we observe that $\mathbb{E}S=2.7$ and $s_{0}\ne 0$ in this case. So, Eq. (4) holds for an arbitrary $n\in \mathbb{N}_{0}$. In particular,

\[ \left\{\begin{array}{l}\varphi (250)=\alpha _{250}\varphi (0)+\beta _{250}\varphi (1)+0.3\gamma _{250},\hspace{1em}\\{} \varphi (251)=\alpha _{251}\varphi (0)+\beta _{251}\varphi (1)+0.3\gamma _{251},\hspace{1em}\end{array}\right.\]

According to the first statement of Theorem 5, we can suppose that $\varphi (250)=\varphi (251)=1$. So, we get $\varphi (0)$ and $\varphi (1)$ from this system after calculating the values of $\{\alpha _{0},\alpha _{1},\dots \alpha _{251}\}$, $\{\beta _{0},\beta _{1},\dots ,\beta _{251}\},$ and $\{\gamma _{0},\gamma _{1},\dots ,\gamma _{251}\}$. Now it remains to use Eq. (4) again to obtain the values $\varphi (u)=1-\psi (u)$ for initial surplus values $u\in \{2,3,\dots ,10,20\}$.

Second example. Suppose now that the three-seasonal discrete-time risk model is generated by three Poison distributions: $Z_{1}$ with parameter $1/2$, $Z_{2}$ with parameter $2/3,$ and $Z_{3}$ with parameter $4/5$. In Table 2, we present the finite-time ruin probabilities for $u\in \{0,1,\dots 10,20\}$, $T\in \{1,2,\dots ,10,20\}$ and the ultimate ruin probabilities for $u\in \{0,1,\dots 10,20\}$. All calculations are made similarly as in the first example.

Third example. We write $\xi \sim \mathcal{G}(p)$ if ξ is a r.v. having the geometric distribution with parameter $p\in (0,1)$, that is, $\mathbb{P}(\xi =k)=p{(1-p)}^{k},k\in \mathbb{N}_{0}$. Suppose that the three-seasonal risk model is generated by r.v.s $Z_{1}\sim \mathcal{G}(3/4)$, $Z_{2}\sim \mathcal{G}(2/3),$ and $Z_{3}\sim \mathcal{G}(1/3)$. In Table 3, we present the finite-time and infinite-time ruin probabilities for this geometric model. The values of initial surpluses u and times T are the same as in the previous examples.

The presented tables show that the behavior of ruin probabilities is closely related to the structure of generating r.v.s and not only to the global model characteristic $\mathbb{E}S$.

Acknowledgement

We would like to thank the anonymous referee for the detailed and helpful comments on the first version of the manuscript.

References

[1]

Asmussen, S., Albrecher, H.: Ruin Probabilities. World Scientific, Singapore (2010). MR2766220. doi:10.1142/9789814282536

[2]

Bieliauskienė, E., Šiaulys, J.: Gerber–Shiu function for the discrete inhomogeneous claim case. Int. J. Comput. Math. 89, 1617–1630 (2012). MR2949469. doi:10.1080/00207160.2012.693607

[3]

Blaževičius, K., Bieliauskienė, E., Šiaulys, J.: Finite-time ruin probability in the inhomogeneous claim case. Lith. Math. J. 50, 260–270 (2010). MR2719562. doi:10.1007/s10986-010-9084-2

[4]

Damarackas, J., Šiaulys, J.: Bi-seasonal discrete-time risk model. Appl. Math. Comput. 247, 930–940 (2014). MR3270895. doi:10.1016/j.amc.2014.09.040

[5]

De Vylder, F.E., Goovaerts, M.J.: Recursive calculation of finite-time ruin probabilities. Insur. Math. Econ. 7, 1–8 (1988). MR0971858. doi:10.1016/0167-6687(88)90089-3

[6]

De Vylder, F.E., Goovaerts, M.J.: Explicit finite-time and infinite-time ruin probabilities in the continuous case. Insur. Math. Econ. 24, 155–172 (1999). MR1704808. doi:10.1016/S0167-6687(98)00049-3

[7]

Dickson, D.C.M.: On numerical evaluation of finite time survival probabilities. Br. Actuar. J 5, 575–584 (1999). doi:10.1017/S135732170000057X

[8]

Dickson, D.C.M.: Insurance Risk and Ruin. Cambridge University Press, Cambridge (2005). MR2160707. doi:10.1017/CBO9780511624155

[9]

Dickson, D.C.M., Waters, R.: Recursive calculation of survival probabilities. ASTIN Bull. 21, 199–221 (1991). doi:10.2143/AST.21.2.2005364

[10]

Gerber, H.U.: Mathematical fun with the compound binomial process. ASTIN Bull. 18, 161–168 (1988). doi:10.2143/AST.18.2.2014949

[11]

Lefèvre, Cl.: Loisel St.: On finite-time ruin probabilities for classical risk models. Scand. Actuar. J. 2008, 41–60 (2008). MR2414622. doi:10.1080/03461230701766882

[12]

Leipus, R., Šiaulys, J.: Finite-horizon ruin probability asymptotics in the compound discrete-time risk model. Lith. Math. J. 51(2), 207–219 (2011). MR2805739. doi:10.1007/s10986-011-9120-x

[13]

Li, S., Lu, Y., Garrido, J.: A review of discrete-time risk models. Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat. 103, 321–337 (2009). MR2582636. doi:10.1007/BF03191910

[14]

Mikosch, T.: Non-Life Insurance Mathematics. Springer, Berlin (2009). MR2503328. doi:10.1007/978-3-540-88233-6

[15]

Picard, Ph.: Lefèvre Cl.: The probability of ruin in finite time with discrete claim size distribution. Scandinavian Actuarial journal, 58–69 (1997). 1997. MR1440825. doi:10.1080/03461238.1997.10413978

[16]

Picard, Ph.: Lefèvre Cl.: Probabilité de ruine éventuelle dans un modèle de risque à temps discret. J. Appl. Probab. 40, 543–556 (2003). MR1993252. doi:10.1239/jap/1059060887

[17]

Seal, H.L.: The Stochastic Theory of a Risk Business. Wiley, New York (1969)

[18]

Shiu, E.S.W.: Calculation of the probability of eventual ruin by Beckman’s convolution series. Insur. Math. Econ. 7, 41–47 (1989). MR0971864. doi:10.1016/0167-6687(88)90095-9

[19]

Shiu, E.S.W.: The probability of eventual ruin in the compound binomial model. ASTIN Bull. 19, 179–190 (1989). doi:10.2143/AST.19.2.2014907

[20]

Tang, Q.: The ruin probability of a discrete-time risk model under constant interest with heavy tails. Scand. Actuar. J. 2004, 229–240 (2004).

Reading mode

Table of contents

1 Introduction
2 Main results
3 Net profit condition
4 Recursive formulas
5 Numerical examples
Acknowledgement
References

Open access article under the CC BY license.

Keywords

Inhomogeneous model three-seasonal model finite-time ruin probability ultimate ruin probability

MSC2010

91B30 60G50

Metrics

since March 2018

627

Article info
views

449

Full article
views

344

PDF
downloads

159

XML
downloads

RSS

Figures
1
Tables
3
Theorems
5

Fig. 1.

Behavior of the surplus sequence $W_{u}(n)$

Table 1.

Ruin probabilities for the first model

Table 2.

Ruin probabilities for the Poison model

Table 3.

Ruin probabilities for the geometric model

Theorem 1.

Theorem 2.

Theorem 3.

Theorem 4.

Theorem 5.

Fig. 1.

Behavior of the surplus sequence $W_{u}(n)$

Table 1.

Ruin probabilities for the first model

T	u
	0	1	2	3	4	5	6	7	8	9	10	20
1	0.5	0.25	0	0	0	0	0	0	0	0	0	0
2	0.65	0.325	0.075	0	0	0	0	0	0	0	0	0
3	0.703	0.404	0.128	0.026	0	0	0	0	0	0	0	0
4	0.733	0.445	0.169	0.046	0.007	0	0	0	0	0	0	0
5	0.751	0.475	0.2	0.066	0.014	0.002	0	0	0	0	0	0
6	0.768	0.503	0.233	0.089	0.026	0.005	0.001	0	0	0	0	0
7	0.779	0.523	0.256	0.106	0.035	0.009	0.002	0	0	0	0	0
8	0.788	0.538	0.275	0.122	0.045	0.014	0.003	0.001	0	0	0	0
9	0.796	0.554	0.295	0.139	0.056	0.019	0.006	0.001	0	0	0	0
10	0.802	0.566	0.310	0.152	0.065	0.024	0.008	0.002	0	0	0	0
20	0.836	0.632	0.402	0.243	0.138	0.075	0.038	0.018	0.008	0.003	0.001	0
∞	0.877	0.722	0.541	0.404	0.301	0.224	0.167	0.125	0.093	0.069	0.052	0.003

Table 2.

Ruin probabilities for the Poison model

T	u
	0	1	2	3	4	5	6	7	8	9	10	20
1	0.393	0.09	0.014	0.002	0	0	0	0	0	0	0	0
2	0.481	0.152	0.037	0.008	0.001	0	0	0	0	0	0	0
3	0.535	0.205	0.066	0.019	0.005	0.001	0	0	0	0	0	0
4	0.549	0.221	0.075	0.023	0.006	0.002	0	0	0	0	0	0
5	0.562	0.236	0.086	0.028	0.009	0.002	0.001	0	0	0	0	0
6	0.576	0.254	0.099	0.036	0.012	0.004	0.001	0	0	0	0	0
7	0.581	0.26	0.103	0.038	0.013	0.004	0.001	0	0	0	0	0
8	0.585	0.266	0.109	0.042	0.015	0.005	0.002	0.001	0	0	0	0
9	0.591	0.274	0.115	0.046	0.017	0.006	0.002	0.001	0	0	0	0
10	0.593	0.277	0.118	0.048	0.018	0.007	0.002	0.001	0	0	0	0
20	0.605	0.295	0.134	0.059	0.026	0.011	0.005	0.002	0.001	0.0003	0.0001	0
∞	0.609	0.3	0.139	0.064	0.029	0.013	0.006	0.003	0.001	0.001	0.0002	0

Table 3.

Ruin probabilities for the geometric model

T	u
	0	1	2	3	4	5	6	7	8	9	10	20
1	0.25	0.063	0.016	0.004	0.001	0	0	0	0	0	0	0
2	0.333	0.111	0.037	0.012	0.004	0.001	0	0	0	0	0	0
3	0.556	0.34	0.218	0.143	0.094	0.063	0.042	0.028	0.019	0.012	0.008	0
4	0.566	0.35	0.226	0.149	0.099	0.066	0.044	0.029	0.019	0.013	0.009	0
5	0.576	0.362	0.236	0.156	0.104	0.069	0.046	0.031	0.021	0.014	0.009	0
6	0.653	0.461	0.334	0.243	0.176	0.127	0.091	0.065	0.046	0.033	0.023	0.001
7	0.657	0.466	0.338	0.247	0.18	0.13	0.093	0.067	0.048	0.034	0.024	0.001
8	0.661	0.471	0.344	0.252	0.184	0.133	0.096	0.069	0.049	0.035	0.025	0.001
9	0.703	0.529	0.406	0.312	0.239	0.181	0.137	0.102	0.076	0.056	0.042	0.002
10	0.705	0.532	0.409	0.315	0.241	0.184	0.139	0.104	0.078	0.057	0.042	0.002
20	0.774	0.635	0.528	0.438	0.363	0.298	0.243	0.197	0.159	0.127	0.101	0.008
∞	0.927	0.879	0.84	0.803	0.769	0.736	0.705	0.675	0.647	0.619	0.593	0.385

Theorem 1.

for all $u\in \mathbb{N}_{0}$ and $T\in \{2,3,\dots \}$.

Theorem 2.

• If $\mathbb{E}X+\mathbb{E}Y<2$, then
\[ \underset{u\to \infty }{\lim }\psi (u)=0.\]
• If $s_{0}=x_{0}y_{0}\ne 0$, then:
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \psi (0)& \displaystyle =1-(2-\mathbb{E}S)\underset{n\to \infty }{\lim }\frac{b_{n+1}-b_{n}}{a_{n}-a_{n+1}},\\{} \displaystyle 1-\psi (u)& \displaystyle =\alpha _{u}\big(1-\psi (0)\big)+\beta _{u}(2-\mathbb{E}S),\hspace{1em}u\in \mathbb{N},\end{array}\]
where $\{\alpha _{n}\}$, $\{\beta _{n}\}$, $n\in \mathbb{N}_{0}$, are two sequences of real numbers defined recursively by formulas:
\[\begin{array}{r@{\hskip0pt}l}& \displaystyle \alpha _{0}=1,\hspace{2em}\alpha _{1}=-\frac{1}{y_{0}},\\{} & \displaystyle \alpha _{n}=\frac{1}{s_{0}}\Bigg(\alpha _{n-2}-{\sum \limits_{i=1}^{n-1}}s_{i}\alpha _{n-i}-x_{n-1}\Bigg),\hspace{1em}n\geqslant 2,\\{} & \displaystyle \beta _{0}=0,\hspace{2em}\beta _{1}=\frac{1}{y_{0}},\\{} & \displaystyle \beta _{n}=\frac{1}{s_{0}}\Bigg(\beta _{n-2}-{\sum \limits_{i=1}^{n-1}}s_{i}\beta _{n-i}+x_{n-1}\Bigg),\hspace{1em}n\geqslant 2.\end{array}\]
• If $s_{0}\ne 0$, then
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \psi (1)& \displaystyle =1-\big(1+\psi (0)-\mathbb{E}S\big)/y_{0},\\{} \displaystyle \psi (u)& \displaystyle =1+\frac{1}{s_{0}}\Bigg(\psi (u-2)-1+{\sum \limits_{k=1}^{u-1}}s_{k}\big(1-\psi (u-k)\big)\Bigg)\\{} & \displaystyle \hspace{1em}-\frac{x_{u-1}(1-\psi (1))}{x_{0}},\hspace{1em}u\in \{2,3,\dots \}.\end{array}\]
• If $x_{0}=0$, $y_{0}\ne 0$, then $s_{1}\ne 0$ and $\psi (0)=1$.
• If $x_{0}\ne 0$, $y_{0}=0$, then $s_{1}\ne 0$ and $\psi (0)=\mathbb{E}S-1$.
• If $s_{0}=0$, then, for $u\in \mathbb{N}$,
\[ \psi (u)=1-\frac{1}{s_{1}}\Bigg(1-\psi (u-1)-{\sum \limits_{k=2}^{u}}s_{k}\big(1-\psi (u-k+1)\big)\Bigg).\]

Theorem 3.

In the three-seasonal discrete-time risk model, for each $u\in \mathbb{N}_{0}$, we have

\[ {\psi }^{(0)}(u,1)=\sum \limits_{k>u}a_{k},\hspace{2em}{\psi }^{(1)}(u,1)=\sum \limits_{k>u}b_{k},\hspace{2em}{\psi }^{(2)}(u,1)=\sum \limits_{k>u}c_{k},\]

and for all $u\in \mathbb{N}_{0}$ and $T\in \{2,3,\dots \}$, we have the following recursive formulas:

Theorem 4.

• $\psi (0)=\psi (1)=\psi (2)=1$ and $\psi (u)=0$ for $u\in \{3,4,\dots \}$ if $\{a_{3}=b_{0}=c_{0}=1\}$;
• $\psi (0)=\psi (1)=1$ and $\psi (u)=0$ for $u\in \{2,3,\dots \}$ if $\{a_{0}=b_{3}=c_{0}=1\}$, $\{a_{2}=b_{1}=c_{0}=1\}$, $\{a_{1}=b_{2}=c_{0}=1\},$ or $\{a_{2}=b_{0}=c_{1}=1\}$;
• $\psi (0)=1$ and $\psi (u)=0$ for all $u\in \mathbb{N}$ if $\{a_{0}=b_{0}=c_{3}=1\}$, $\{a_{0}=b_{2}=c_{1}=1\}$, $\{a_{0}=b_{1}=c_{2}=1\}$, $\{a_{1}=b_{0}=c_{2}=1\}$, or $\{a_{1}=b_{1}=c_{1}=1\}$;
• $\psi (u)=1$ for all $u\in \mathbb{N}_{0}=\{0,1,2,\dots \}$ if $s_{3}<1$.

Theorem 5.

• $\underset{u\to \infty }{\lim }\varphi (u)=1$.
• If $s_{0}\ne 0$, then

(4)
\[ \varphi (n)=\alpha _{n}\varphi (0)+\beta _{n}\varphi (1)+\gamma _{n}(3-\mathbb{E}S),\hspace{1em}n\in \mathbb{N}_{0},\]
where
\[ \left\{\begin{array}{l}\alpha _{0}=1,\hspace{2em}\alpha _{1}=0,\hspace{2em}\alpha _{2}=-\frac{1}{b_{0}c_{0}},\hspace{1em}\\{} \alpha _{n}=\frac{1}{s_{0}}(\alpha _{n-3}-{\textstyle\sum _{k=1}^{n-1}}s_{k}\alpha _{n-k}-a_{n-2}),\hspace{1em}n\geqslant 3;\hspace{1em}\end{array}\right.\]

\[ \left\{\begin{array}{l}\beta _{0}=0,\hspace{2em}\beta _{1}=1,\hspace{2em}\beta _{2}=-\frac{c_{1}}{c_{0}}-\frac{1}{b_{0}},\hspace{1em}\\{} \beta _{n}=\frac{1}{s_{0}}(\beta _{n-3}-{\textstyle\sum _{k=1}^{n-1}}s_{k}\beta _{n-k}-a_{n-2}c_{0}+c_{0}{\textstyle\sum _{k=0}^{n-1}}a_{k}b_{n-1-k}),\hspace{1em}n\geqslant 3;\hspace{1em}\end{array}\right.\]

\[ \left\{\begin{array}{l}\gamma _{0}=0,\hspace{2em}\gamma _{1}=0,\hspace{2em}\gamma _{2}=\frac{1}{b_{0}c_{0}},\hspace{1em}\\{} \gamma _{n}=\frac{1}{s_{0}}(\gamma _{n-3}-{\textstyle\sum _{k=1}^{n-1}}s_{k}\gamma _{n-k}+a_{n-2}),\hspace{1em}n\geqslant 3.\hspace{1em}\end{array}\right.\]
• If $\{a_{0}=0,b_{0}\ne 0,c_{0}\ne 0,a_{1}\ne 0\}$, then

(5)
\[ \left\{\begin{array}{l}\varphi (0)=0,\hspace{1em}\\{} \varphi (n)=\hat{\beta }_{n}\varphi (1)+\hat{\gamma }_{n}(3-\mathbb{E}S),\hspace{1em}n\in \mathbb{N},\hspace{1em}\end{array}\right.\]
where
\[ \left\{\begin{array}{l}\hat{\beta }_{1}=\beta _{1},\hspace{2em}\hat{\beta }_{2}=\beta _{2},\hspace{2em}\hat{\gamma }_{1}=\gamma _{1},\hspace{2em}\hat{\gamma }_{2}=\gamma _{2},\hspace{1em}\\{} \hat{\beta }_{n}=\frac{1}{s_{1}}(\hat{\beta }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\hat{\beta }_{n-k+1}\hspace{1em}\\{} \hspace{2em}\hspace{2.5pt}-\hspace{0.1667em}a_{n-1}c_{0}-c_{0}\varphi (1){\textstyle\sum _{k=1}^{n}}a_{k}b_{n-k}),\hspace{1em}n\geqslant 3,\hspace{1em}\\{} \hat{\gamma }_{n}=\frac{1}{s_{1}}(\hat{\gamma }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\hat{\gamma }_{n-k+1}+a_{n-1}),\hspace{1em}n\geqslant 3.\hspace{1em}\end{array}\right.\]
• If $\{a_{0}\ne 0,b_{0}=0,c_{0}\ne 0,b_{1}\ne 0\}$ then

(6)
\[ \varphi (n)=\tilde{\alpha }_{n}\varphi (0)+\tilde{\gamma }_{n}(3-\mathbb{E}S),\hspace{1em}n\in \mathbb{N},\]
where
\[ \left\{\begin{array}{l}\tilde{\alpha }_{1}=-1/c_{0},\hspace{2em}\tilde{\alpha }_{2}=c_{1}/{c_{0}^{2}}+1/(a_{0}b_{1}c_{0}),\hspace{1em}\\{} \tilde{\gamma }_{1}=1/c_{0},\hspace{2em}\tilde{\gamma }_{2}=-c_{1}/{c_{0}^{2}},\hspace{1em}\\{} \tilde{\alpha }_{n}=\frac{1}{s_{1}}(\tilde{\alpha }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\tilde{\alpha }_{n-k+1}-{\textstyle\sum _{k=0}^{n-1}}a_{k}b_{n-k}),\hspace{1em}n\geqslant 3,\hspace{1em}\\{} \tilde{\gamma }_{n}=\frac{1}{s_{1}}(\tilde{\gamma }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\tilde{\gamma }_{n-k+1}+{\textstyle\sum _{k=0}^{n-1}}a_{k}b_{n-k}),\hspace{1em}n\geqslant 3.\hspace{1em}\end{array}\right.\]
• If $\{a_{0}\ne 0,b_{0}\ne 0,c_{0}=0,c_{1}\ne 0\}$, then

(7)
\[ \varphi (n)=\breve{\alpha }_{n}\varphi (0)+\breve{\gamma }_{n}(3-\mathbb{E}S),\hspace{1em}n\in \mathbb{N}_{0},\]
where
\[ \left\{\begin{array}{l}\breve{\alpha }_{0}=1,\hspace{2em}\breve{\alpha }_{1}=-1/(b_{0}c_{1}),\hspace{2em}\breve{\gamma }_{0}=0,\hspace{2em}\breve{\gamma }_{1}=1/(b_{0}c_{1}),\hspace{1em}\\{} \breve{\alpha }_{n}=\frac{1}{s_{1}}(\breve{\alpha }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\breve{\alpha }_{n-k+1}-{\textstyle\sum _{k=0}^{n-1}}a_{k}b_{n-k}),\hspace{1em}n\geqslant 2,\hspace{1em}\\{} \breve{\gamma }_{n}=\frac{1}{s_{1}}(\breve{\gamma }_{n-2}-{\textstyle\sum _{k=2}^{n}}s_{k}\breve{\gamma }_{n-k+1}+{\textstyle\sum _{k=0}^{n-1}}a_{k}b_{n-k}),\hspace{1em}n\geqslant 2.\hspace{1em}\end{array}\right.\]
• If $\{a_{0}=0,b_{0}=0,c_{0}\ne 0\}$, then $\varphi (0)=0$, $\varphi (1)=(3-\mathbb{E}S)/c_{0}$, and

(8)
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \varphi (u+1)& \displaystyle =\frac{1}{s_{2}}\Bigg((1-s_{3})\varphi (u)-{\sum \limits_{k=1}^{u-1}}\varphi (k)s_{u+3-k}\\{} & \displaystyle \hspace{1em}+c_{0}\varphi (1){\sum \limits_{k=0}^{u+2}}a_{k}b_{u+2-k}\Bigg),\hspace{1em}u\in \mathbb{N}.\end{array}\]
• If $\{a_{0}=0,b_{0}\ne 0,c_{0}=0\}$, then $\varphi (0)=s_{2}\varphi (1)$, $\varphi (1)=(3-\mathbb{E}S)/(s_{2}+b_{0}c_{1})$, and

(9)
\[\begin{array}{r@{\hskip0pt}l}\displaystyle \varphi (u+1)& \displaystyle =\frac{1}{s_{2}}\Bigg((1-s_{3})\varphi (u)-{\sum \limits_{k=1}^{u-1}}\varphi (k)s_{u+3-k}\\{} & \displaystyle \hspace{1em}+a_{u+1}b_{0}c_{1}\varphi (1)\Bigg),\hspace{1em}u\in \mathbb{N}.\end{array}\]
• If $\{a_{0}\ne 0,b_{0}=0,c_{0}=0\}$, then $\varphi (0)=3-\mathbb{E}S$, $\varphi (1)=(3-\mathbb{E}S)/s_{2}$, and

(10)
\[\begin{array}{r@{\hskip10.0pt}c@{\hskip10.0pt}l}& & \displaystyle \varphi (u+1)=\frac{1}{s_{2}}\Bigg((1-s_{3})\varphi (u)+{\sum \limits_{k=1}^{u-1}}\varphi (k)s_{u+3-k}\Bigg),\hspace{1em}u\in \mathbb{N}.\end{array}\]
• If $\{a_{0}=a_{1}=0,b_{0}\ne 0,c_{0}\ne 0\}$, then $\varphi (0)=0$, $\varphi (1)=(3-\mathbb{E}S)/(1/a_{2}+c_{0})$, and the recursion formula (8) is satisfied.
• If $\{a_{0}\ne 0,b_{0}=b_{1}=0,c_{0}\ne 0\}$, then $\varphi (0)=0$, $\varphi (1)=(3-\mathbb{E}S)/c_{0}$, and the same recursion formula (8) holds.
• If $\{a_{0}\ne 0,b_{0}\ne 0,c_{0}=c_{1}=0\}$, then $\varphi (0)=3-\mathbb{E}S$, $\varphi (1)=(3-\mathbb{E}S)/s_{2}$, and the recursion formula (10) is satisfied.

Authors

Abstract

1 Introduction

(1)

Fig. 1.

(2)

(3)

Theorem 1.

Theorem 2.

2 Main results

Definition 1.

Theorem 3.

Theorem 4.

Theorem 5.

(4)

(5)

(6)

(7)

(8)

(9)

(10)

3 Net profit condition

Proof of Theorem 4.

(11)

(12)

(13)

(14)

(15)

(16)

(17)

(18)

(19)

(20)

(21)

(22)

(23)

4 Recursive formulas

Proof of Theorem 5.

(24)

(25)

(26)

(27)

5 Numerical examples

Table 1.

Table 2.

Table 3.

Acknowledgement

References

Export citation

Copy and paste formatted citation

Download citation in file

Fig. 1.

Table 1.

Table 2.

Table 3.

Theorem 1.

Theorem 2.

Theorem 3.

Theorem 4.

Theorem 5.

(4)

(5)

(6)

(7)

(8)

(9)

(10)