اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAsymptotics and approximations of ruin probabilities for multivariate risk processes in a Markovian environment
65
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper develops asymptotics and approximations for ruin probabilities in a multivariate risk setting. We consider a model in which the individual reserve processes are driven by a common Markovian environmental process. We subsequently consider a regime in which the claim arrival intensity and transition rates of the environmental process are jointly sped up, and one in which there is (with overwhelming probability) maximally one transition of the environmental process in the time interval considered. The approximations are extensively tested in a series of numerical experiments.
قيم البحث
اقرأ أيضاً
In this paper we give few expressions and asymptotics of ruin probabilities for a Markov modulated risk process for various regimes of a time horizon, initial reserves and a claim size distribution. We also consider f
Based on a discrete version of the Pollaczeck-Khinchine formula, a general method to calculate the ultimate ruin probability in the Gerber-Dickson risk model is provided when claims follow a negative binomial mixture distribution. The result is then
extended for claims with a mixed Poisson distribution. The formula obtained allows for some approximation procedures. Several examples are provided along with the numerical evidence of the accuracy of the approximations.
The classical Cramer-Lundberg risk process models the ruin probability of an insurance company experiencing an incoming cash flow - the premium income, and an outgoing cash flow - the claims. From a systems viewpoint, the web of insurance agents and
risk objects can be represented by a bipartite network. In such a bipartite network setting, it has been shown that joint ruin of a group of agents may be avoided even if individual agents would experience ruin in the classical Cramer-Lundberg model. This paper describes and examines a phase transition phenomenon for these ruin probabilities.
We develop accurate approximations of the delay distribution of the MArP/G/1 queue that cap- ture the exact tail behavior and provide bounded relative errors. Motivated by statistical analysis, we consider the service times as a mixture of a phase-ty
pe and a heavy-tailed distribution. With the aid of perturbation analysis, we derive corrected phase-type approximations as a sum of the delay in an MArP/PH/1 queue and a heavy-tailed component depending on the perturbation parameter. We exhibit their performance with numerical examples.
Significant correlations between arrivals of load-generating events make the numerical evaluation of the workload of a system a challenging problem. In this paper, we construct highly accurate approximations of the workload distribution of the MAP/G/
1 queue that capture the tail behavior of the exact workload distribution and provide a bounded relative error. Motivated by statistical analysis, we consider the service times as a mixture of a phase-type and a heavy-tailed distribution. With the aid of perturbation analysis, we derive our approximations as a sum of the workload distribution of the MAP/PH/1 queue and a heavy-tailed component that depends on the perturbation parameter. We refer to our approximations as corrected phase-type approximations, and we exhibit their performance with a numerical study.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
