phase type distributions
Recently Published Documents


TOTAL DOCUMENTS

216
(FIVE YEARS 31)

H-INDEX

25
(FIVE YEARS 3)

2022 ◽  
pp. 1-32
Author(s):  
Martin Bladt

Abstract This paper addresses the task of modeling severity losses using segmentation when the data distribution does not fall into the usual regression frameworks. This situation is not uncommon in lines of business such as third-party liability insurance, where heavy-tails and multimodality often hamper a direct statistical analysis. We propose to use regression models based on phase-type distributions, regressing on their underlying inhomogeneous Markov intensity and using an extension of the expectation–maximization algorithm. These models are interpretable and tractable in terms of multistate processes and generalize the proportional hazards specification when the dimension of the state space is larger than 1. We show that the combination of matrix parameters, inhomogeneity transforms, and covariate information provides flexible regression models that effectively capture the entire distribution of loss severities.


2021 ◽  
Vol 58 (4) ◽  
pp. 880-889
Author(s):  
Qi-Ming He

AbstractWe consider a class of phase-type distributions (PH-distributions), to be called the MMPP class of PH-distributions, and find bounds of their mean and squared coefficient of variation (SCV). As an application, we have shown that the SCV of the event-stationary inter-event time for Markov modulated Poisson processes (MMPPs) is greater than or equal to unity, which answers an open problem for MMPPs. The results are useful for selecting proper PH-distributions and counting processes in stochastic modeling.


2021 ◽  
Vol 16 (4) ◽  
pp. 3941-3959
Author(s):  
Cynthia Mwende Mwau ◽  
Patrick Guge Weke ◽  
Bundi Davis Ntwiga ◽  
Joseph Makoteku Ottieno

This research in-cooperates phase type distributions of Panjer class \((a,b,1)\) in estimation of aggregate loss probabilities of secondary cancer. Matrices of the phase type distributions are derived using Chapman-Kolmogorov equation and transition probabilities estimated using modified Kaplan-Meir and consequently the transition intensities and transition probabilities. Stationary probabilities of the Markov chains represents $\vec{\gamma}$. Claim amount are modeled using OPPL, TPPL, Pareto, Generalized Pareto and Wei-bull distributions. PH ZT Poisson with Generalized Pareto distribution provided the best fit.


Author(s):  
Fahrettin Özbey

In this paper, we propose a shock model for an m-consecutive- k, l-out-of- n: F system. This paper presents a reliability analysis of an m-consecutive- k, l-out-of- n: F system subjected to shocks that destroy a random number of components. One of the main random variables is the number of components affected by successive shocks. Phase-type distributions have been used to model the intervals between successive shocks. The main objective of this study is to show how phase-type distributions can be used to determine the reliability of m-consecutive- k, l-out-of- n: F systems subjected to shocks, which destroy a random number of components. Consideration is given to the optimal replacement time problem, which addresses the minimization of the total long-run average cost per unit time.


Author(s):  
Chen Fang ◽  
Lirong Cui

Based on some real backgrounds, a new balanced system structure, a consecutive k-out-of- m: F system with a symmetry line, is proposed in this paper. Considering different state numbers of a subsector, the new balanced system is analyzed under two situations respectively: the subsector with binary-state and the subsector with multi-state, while the multi-state balanced systems have not been studied in the previous research. Besides, two models are developed in terms of assumptions for the two situations, respectively. For this system, several methods, such as the finite Markov chain imbedding approach, the order statistics technique and the phase-type distributions, are used on the models. In addition to system reliability formulas, the means and variances of the system lifetimes under two models for different situations are given. Finally, numerical examples are presented to illustrate the results obtained in this paper.


Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1797
Author(s):  
Divya Velayudhan Nair ◽  
Achyutha Krishnamoorthy ◽  
Agassi Melikov ◽  
Sevinj Aliyeva

In this paper, we consider two single server queueing systems to which customers of two distinct priorities (P1 and P2) arrive according to a Marked Markovian arrival process (MMAP). They are served according to two distinct phase type distributions. The probability of a P1 customer to feedback is θ on completion of his service. The feedback (P1) customers, as well as P2 customers, join the low priority queue. Low priority (P2) customers are taken for service from the head of the line whenever the P1 queue is found to be empty at the service completion epoch. We assume a finite waiting space for P1 customers and infinite waiting space for P2 customers. Two models are discussed in this paper. In model I, we assume that the service of P2 customers is according to a non-preemptive service discipline and in model II, the P2 customers service follow a preemptive policy. No feedback is permitted to customers in the P2 line. In the steady state these two models are compared through numerical experiments which reveal their respective performance characteristics.


Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1404
Author(s):  
Alessio Angius ◽  
András Horváth ◽  
Marcello Urgo

The application of theoretical scheduling approaches to the real world quite often crashes into the need to cope with uncertain events and incomplete information. Stochastic scheduling approaches exploiting Markov models have been proposed for this class of problems with the limitation to exponential durations. Phase-type approximations provide a tool to overcome this limitation. This paper proposes a general approach for using phase-type distributions to model the execution of a network of activities with generally distributed durations through a Markov chain. An analytical representation of the infinitesimal generator of the Markov chain in terms of Kronecker algebra is proposed, providing a general formulation for this class of problems and supporting more efficient computation methods. This entails the capability to address stochastic scheduling in terms of the estimation of the distribution of common objective functions (i.e., makespan, lateness), enabling the use of risk measures to address robustness.


Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 363
Author(s):  
Delia Montoro-Cazorla ◽  
Rafael Pérez-Ocón ◽  
Alicia Pereira das Neves-Yedig

A longitudinal study for 847 bladder cancer patients for a period of fifteen years is presented. After the first surgery, the patients undergo successive ones (recurrences). A state-model is selected for analyzing the evolution of the cancer, based on the distribution of the times between recurrences. These times do not follow exponential distributions, and are approximated by phase-type distributions. Under these conditions, a multidimensional Markov process governs the evolution of the disease. The survival probability and mean times in the different states (levels) of the disease are calculated empirically and also by applying the Markov model, the comparison of the results indicate that the model is well-fitted to the data to an acceptable significance level of 0.05. Two sub-cohorts are well-differenced: those reaching progression (the bladder is removed) and those that do not. These two cases are separately studied and performance measures calculated, and the comparison reveals details about the characteristics of the patients in these groups.


Sign in / Sign up

Export Citation Format

Share Document