Recently, a lot of papers were published on the issue of the ruin probability, we refer the reader to [1-6] for more details. We say that a random variable $\xi$ (or its distribution function $F$) is heavy-tailed if it has no finite exponential moments. In ruin probability theory, heavy-tailed distributions are often used to model large claims. They play a key role in some fields such as insurance, financial mathematics and queueing theory. In this paper, we use an important subclass of heavy-tailed distribution, which is called $\mathcal{C}$. A distribution function $F$ belongs to $\mathcal{C}$ if
Set
In [7], $\gamma_F$ is called the upper Matuszewska index of the nonnegative and nondecreasing function $f(x)=(\bar{F}(x))^{-1}$, $x>0.$ Without any danger of confusion, we simply call $\gamma_F$ the upper Matuszewska index of the distribution $F$. See Chapter 2.1 of [7] and [8] for more details of the Matuszewska index.
The ruin probability in a discrete-time unit-risk model was investigated in [9-11] among other. In these papers, they always assumed that the company provides only one kind of insurance contract. In reality this assumption is not correct, for example, an unexpected claim even might induce more than one type of claim in an umbrella insurance policy. A typical example is motor insurance where an accident could cause claims for vehicle damages and the third party injuries. So the ruin probability of multi-risk models is more valuable. In present paper, we consider a discrete-time multi-risk model with a random interest rate and assume that the insurance company has $k$ classes of insurance contract. Other basic assumptions of this model are as follows:
A1 For $s=1,2,\cdots,k$, the $s$th type related net incomes $\xi_{si},i=1,2,\cdots ,n$, constitute a sequence of dependent random variables with common distribution $F_{s}$ concentrated on $(-\infty,+\infty)$, where the net incomes $\xi_{si}$, called the insurance risk, is understood as the total incoming premium minus the total claim amount within year $n$. And $\{\xi_{si},i=1,2,\cdots ,n\}$ satisfy the assumption condition: $\exists x_{0}>0$ and $c>0$ such that
for all $1\leq i\leq n$, $\emptyset \neq J \subset \{1,2,\cdots ,n\}\backslash \{i\}$, $x_{i}>x_{0}$, and $x_{j}>x_{0}$ with $j\in J$. Remark that this condition is assumption $B$ of [1], we denote this assumption condition by assumption $A$ which will be used in Proposition 2.1.
A2 For $j=1,2,\cdots,n$, $\eta_{j}$, called the financial risk, is the discount factor from year $j$ to year $j-1$. They constitute a sequence of independent identical distributed random variables, satisfy that there exist some constants $a<a\leq b<\infty$ such that $P(a\leq \eta_i\leq b)=1$ for all $1\leq i \leq n$.
A3 $\{\xi_{si},i=1,2,\cdots ,n\}^{k}_{s=1}$ and $\{\eta_{j},j=1,2,\cdots ,n\}$ are mutually independent.
Let the initial capital of the insurance company be $x\geq 0$. We tacitly assume that the $s$th type related net incomes $\xi_{si}$ is calculated at the beginning of year $i$, and the discounted value of the surplus of the company accumulated till the beginning of year $m$ can be characterized by $S_{sm}$, $m=1,2,\cdots $, which satisfy the recurrence equation below:
Hence the ruin probability in the considered multi-risk model with initial capital $x\geq 0$ is defined by $\varphi^{k}(x,n)=P\Big(\max\limits_{1\leq m\leq n}\sum^{k}\limits_{s=1}\sum^{m}\limits_{i=1}\xi_{si}\prod^{i-1}_{j=1}\eta_{j}\Big).$
In this section, several propositions used in Section 3 are provided, and our main result is presented.
Proposition 2.1 Suppose that $\{\xi_{i}, 1\leq i \leq n\}$ are $n$ real-valued random variables with $F_{i}\in \mathcal{C}$ for all $1\leq i\leq n$, and $F_{i}\ast F_{j}\in \mathcal{C}$ for all $1\leq i\neq j \leq n$, and satisfy that $\exists x_{0}>0$ and $c>0$ such that
for all $1\leq i\leq n$, $\emptyset \neq J \subset \{1,2,\cdots ,n\}\backslash \{i\}$, $x_{i}>x_{0}$, and $x_{j}>x_{0}$ with $j\in J$. If there exist some constants $0<a\leq b<\infty$ such that $P(a\leq \eta_{i} \leq b)=1$ for all $1\leq i\leq n$, then the following relation
as $x\rightarrow \infty$. Here $F_{i}\ast F_{j}\in \mathcal{C}$ denotes the convolution of distribution $F_{i}$ and $F_{j}$.
This proposition is the conclusion of Theorem 2 of [1] when distribution function belongs to $\mathcal{C}$, and plays a key role in the proof of our result. Repeated using Corollary 2.5 of [8], we can get the following proposition.
Proposition 2.2 If $\xi \in \mathcal{C}$, there exist some constants $0<a\leq b<\infty$ such that $P(a\leq \eta_{i} \leq b)=1$ for all $1\leq i\leq k$, then $\xi \prod^{k}_{i=1}\eta_{k}\in \mathcal{C}$.
From Theorem 3.3 of [8], we can obtain Proposition 2.3, that is
Proposition 2.3 If $\xi\in \mathcal{C}$, $E\eta^{p}<\infty$ for some $p>{\gamma}_F$, and $\xi$ and $\eta$ are mutually independent, then $P(\xi \eta >x)\asymp P(\xi >x)$.
The following exhibits one such situation in a discrete-time multi-risk model and is the main result of this paper.
Theorem 2.1 Suppose that assumptions A1-A3 hold, and $F_{s} \in \mathcal{C}$ and $\gamma_{F_{s}}>0$ for $1\leq s\leq k$. If there exists some positive constant $p>\max\limits_{1\leq s\leq k}\gamma_{F_{s}}$ such that $E\eta_{i}^{p}<\infty$ for all $1\leq i\leq n$, then
holds for any $n\geq 1$.
For notational convenience, throughout this section, all limit relations are for $x\rightarrow \infty$ unless stated otherwise. In order to prove Theorem 2.1, we need to divide the proof into the following two theorems.
Theorem 3.1 Under the conditions of Theorem 2.1, we have
Proof We give the proof of Theorem 3.1 by induction approach. It is trivial that relation $(3.1)$ holds for $k=1$ from Proposition 2.1. When $k=2$, for any fixed $0<\varepsilon<\frac{1}{2}$, we have
First, we deal with $P_{1}$. By Proposition 2.1 and Proposition 2.2, for any $0<\delta<1$, we have
Similarly to the proof of relation $(3.3)$, we have
Now we deal with $P_{3}$. For any $0<\delta<1$ and any fixed $0<\varepsilon<\frac{1}{2}$,
where the last step is obtained by $\lim\limits_{x\rightarrow\infty}P\Big(\xi_{1i} b^{i-1}>\frac{\varepsilon x}{n}\Big)=0$ for $1\leq i\leq n $. Since $\xi_{2i}\prod\limits_{j=1}^{i-1}\in \mathcal{C}$ for $1\leq i\leq n $, there exists some $M_{1}>0$, for any fixed $0<\varepsilon<\frac{1}{2}$ such that
So, from relation $(3.5)$, Proposition 2.1 and relation $(3.6)$, we get
Combining relation $(3.3)$, $(3.4)$ and $(3.7)$ to relation $(3.2)$, by the arbitrariness of $0<\delta<1$, relation $(3.1)$ holds for $k=2$.
Next suppose that relation $(3.1)$ holds for $k-1$, we want to prove it right for $k$. By the similar method from relation $(3.2)$ to $(3.7)$, for any fixed $0<\varepsilon<\frac{1}{2}$ and any $0<\delta<1$,
The arbitrariness of $0<\delta<1$ gives result $(3.1)$. This ends the proof of Theorem 3.1.
Theorem 3.2 Under the conditions of Theorem 2.1, we have
Proof We prove relation $(3.8)$ by induction in $k$. For the case of $k=1$, relation $(3.8)$ holds from Proposition 2.1. From Theorem 3.1, it suffices to prove that relation $(3.8)$ holds for $k=2$.
When $k=2$, for any fixed $0<\varepsilon<1$ and $x>0$, we have
For $Q_{1}$, we have
For $1\leq j\leq n$, in view of $\eta_j\in [a,b]$, for any fixed $0<\varepsilon<1$, we have
Since $\lim\limits_{x\rightarrow\infty}P\Big(\xi_{2i}>\frac{-\varepsilon x}{n}\Big)=1$ for $1\leq i\leq n$, then for any small $0<\delta<1$ and any fixed $0<\varepsilon<1$, we have
Thus, combing relation $(3.10)$, relation $(3.11)$, Proposition 2.1 and Proposition 2.2, for any small $0<\delta<1$ and any fixed $0<\varepsilon<1$,
Symmetrically,
Next we turn to $Q_{3}$. In view of $\xi_{1i}\in \mathcal{C}$, and $\eta_j$ is bounded for $1\leq i \leq n$, by Proposition 2.3, there is some $M_{2}>0$ such that
Thus, we have
Because of $\xi_{2i}\in \mathcal{C}$ for $1\leq i\leq n$, there exists some $M_{3}>0$ such that
So, by relation $(3.14)$ and $(3.15)$, we have
Then, using Fatou's lemma, and relation $(3.16)$, we obtain
where in the fourth equality, we use the following true
Combing relation $(3.12)$, relation $(3.13)$ and relation $(3.17)$, the arbitrariness of $0<\delta<1$ gives result $(3.8)$ for $k=2$. So Theorem 3.2 holds. From Theorem 3.1 and Theorem 3.2, we know that Theorem 2.1 holds.