Consider a Lamperti–Kiu Markov additive process $(J, \xi)$ on $\{+, -\}\times\mathbb R\cup \{-\infty\}$, where J is the modulating Markov chain component. First we study the finiteness of the exponential functional and then consider its moments and tail asymptotics under Cramér’s condition. In the strong subexponential case we determine the subexponential tails of the exponential functional under some further assumptions.

We analyse ruin probabilities for an insurance risk process with a more generalised dependence structure compared to the one introduced in Constantinescu et al. (2016). In this paper, we assume that a random threshold window is generated every time after a claim occurs. By comparing the previous inter-claim time with the threshold window, the distributions of the current threshold window and the inter-arrival time are determined. Furthermore, the statuses for the previous and current inter-arrival times give rise to the current claim size distribution as well. Like Constantinescu et al. (2016), we first identify the embedded Markov additive process where all the randomness takes a general form. Inspired by the Erlangisation technique, the key message of this paper is to analyse such risk process using a Markov fluid flow model where the underlying random variables follow phase-type distributions. This would further allow us to approximate the fixed observation windows by Erlang random variables. Then ruin probabilities under the process with Erlang(n) observation windows are proved to be Erlangian approximations for those related to the process with fixed threshold windows at the limit. An exact form of the limit can be obtained whose application will be illustrated further by a numerical example.

In this paper we identify three questions concerning the management of risk networks with a central branch, which may be solved using the extensive machinery available for one-dimensional risk models. First, we propose a criterion for judging whether a subsidiary is viable by its readiness to pay dividends to the central branch, as reflected by the optimality of the zero-level dividend barrier. Next, for a deterministic central branch which must bailout a single subsidiary each time its surplus becomes negative, we determine the optimal bailout policy, as well as the ruin probability and other risk measures, in closed form. Moreover, we extend these results to the case of hierarchical networks. Finally, for nondeterministic central branches with one subsidiary, we compute approximate risk measures by applying rational approximations, and by using the recently developed matrix scale methodology.

Consider Wald's sequential probability ratio test for deciding whether a sequence of independent and identically distributed observations comes from a specified phase-type distribution or from an exponentially tilted alternative distribution. Exact decision boundaries for given type-I and type-II errors are derived by establishing a link with ruin theory. Information on the mean sample size of the test can be retrieved as well. The approach relies on the use of matrix-valued scale functions associated with a certain one-sided Markov additive process. By suitable transformations, the results also apply to other types of distributions, including some distributions with regularly varying tails.

In this note we provide a simple alternative probabilistic derivation of an explicit formula of Kwan and Yang (2007) for the probability of ruin in a risk model with a certain dependence between general claim interoccurrence times and subsequent claim sizes of conditionally exponential type. The approach puts the type of formula in a general context, illustrating the potential for similar simple ruin probability expressions in more general risk models with dependence.

Let (X, J) denote a Markov-modulated Brownian motion (MMBM) and denote its supremum process by S. For some a > 0, let σ(a) denote the time when the reflected process Y := S - X first surpasses the level a. Furthermore, let σ−(a) denote the last time before σ(a) when X attains its current supremum. In this paper we shall derive the joint distribution of Sσ(a), σ−(a), and σ(a), where the latter two will be given in terms of their Laplace transforms. We also provide some remarks on scale matrices for MMBMs with strictly positive variation parameters. This extends recent results for spectrally negative Lévy processes to MMBMs. Due to well-known fluid embedding and state-dependent killing techniques, the analysis applies to Markov additive processes with phase-type jumps as well. The result is of interest to applications such as the dividend problem in insurance mathematics and the buffer overflow problem in queueing theory. Examples will be given for the former.

In this paper we determine the distributions of occupation times of a Markov-modulated Brownian motion (MMBM) in separate intervals before a first passage time or an exit from an interval. We derive the distributions in terms of their Laplace transforms, and we also distinguish between occupation times in different phases. For MMBMs with strictly positive variation parameters, we further propose scale functions.

In this paper we consider the first passage process of a spectrally negative Markov additive process (MAP). The law of this process is uniquely characterized by a certain matrix function, which plays a crucial role in fluctuation theory. We show how to identify this matrix using the theory of Jordan chains associated with analytic matrix functions. This result provides us with a technique that can be used to derive various further identities.

We consider a Markov-modulated Brownian motion reflected to stay in a strip [0, B]. The stationary distribution of this process is known to have a simple form under some assumptions. We provide a short probabilistic argument leading to this result and explain its simplicity. Moreover, this argument allows for generalizations including the distribution of the reflected process at an independent, exponentially distributed epoch. Our second contribution concerns transient behavior of the model. We identify the joint law of the processes defining the model at inverse local times.

We consider a Markov additive process (MAP) with phase-type jumps, starting at 0. Given a positive level u, we determine the joint distribution of the undershoot and overshoot of the first jump over the level u, the maximal level before this jump, the time of attaining this maximum, and the time between the maximum and the jump. The analysis is based on first passage times and time reversion of MAPs. A marginal of the derived distribution is the Gerber-Shiu function, which is of interest to insurance risk. Several examples serve to compare the present result with the literature.

The present paper generalises some results for spectrally negative Lévy processes to the setting of Markov additive processes (MAPs). A prominent role is assumed by the first passage times, which will be determined in terms of their Laplace transforms. These have the form of a phase-type distribution, with a rate matrix that can be regarded as an inverse function of the cumulant matrix. A numerically stable iteration to compute this matrix is given. The theory is first developed for MAPs without positive jumps and then extended to include positive jumps having phase-type distributions. Numerical and analytical examples show agreement with existing results in special cases.

Computer analysis of biological sequences often detects deviations from a random model. In the usual model, sequence letters are chosen independently, according to some fixed distribution over the relevant alphabet. Real biological sequences often contain simple repeats, however, which can be broadly characterized as multiple contiguous copies (usually inexact) of a specific word. This paper quantifies inexact simple repeats as local sums in a Markov additive process (MAP). The maximum of the local sums has an asymptotic distribution with two parameters (λ and k), which are given by general MAP formulas. The general MAP formulas are usually computationally intractable, but an essential simplification in the case of repeats permits λ and k to be computed from matrices whose dimension equals the size of the relevant alphabet. The simplification applies to some MAPs where the summand distributions do not depend on consecutive pairs of Markov states as usual, but on pairs with a fixed time-lag larger than one.

In this paper, we present an iterative procedure to calculate explicitly the Laplace transform of the distribution of the maximum for a Lévy process with positive jumps of phase type. We derive error estimates showing that this iteration converges geometrically fast. Subsequently, we determine the Laplace transform of the law of the upcrossing ladder process and give an explicit pathwise construction of this process.

We consider the asymptotic behaviour of the stationary tail probabilities in the discrete-time GI/G/1-type queue with countable background state space. These probabilities are presented in matrix form with respect to the background state space, and shown to be the solution of a Markov renewal equation. Using this fact, we consider their decay rates. Applying the Markov renewal theorem, it is shown that certain reasonable conditions lead to the geometric decay of the tail probabilities as the level goes to infinity. We exemplify this result using a discrete-time priority queue with a single server and two types of customer.

Much of the literature in reliability and survival analysis considers failure models indexed by a single scale. There are situations which require that failure be described by several scales. An example from reliability is items under warranty whose failure is recorded by time and amount of use. An example from survival analysis is the death of a mine worker which is noted by age and the duration of exposure to dust.

This paper proposes an approach for developing probabilistic models indexed by two scales: time, and usage, a quantity that is related to time. The relationship between the scales is described by an additive hazards model. The evolution of usage is described by stochastic processes like the Poisson, the gamma and the Markov additive. The paper concludes with an application involving the setting of warranties. Two features differentiate this work from related efforts: a use of specific processes for describing usage, and a use of Monte Carlo techniques for generating the models.

The steady-state distribution of the inventory position for a continuous review (s, S) inventory system is derived. The demand for items in inventory is dependent on an external environment. During an interval of time in which the environment is in a fixed state, the demand follows a discrete-valued compound Poisson process. The parameters of the compound Poisson process depend completely on the state of the environment. The environmental process is modeled as a continuous-time Markov process.

We use a result on integration by parts for stochastic integrals together with a technique developed by Getoor in [6], to express entrance—exit distributions for a standard process X, and a set Φ which is the support of a continuous additive functional C, in terms of the infinitesimal generators of semigroups associated with the time-changed process (Xτt), where (τt) is the right-continuous inverse of C.

A conditional Poisson process (often called a double stochastic Poisson process) is characterized as a random time transformation of a Poisson process with unit intensity. This characterization is used to exhibit the jump times and sizes of these processes, and to study their limiting behavior. A conditional Poisson process, whose intensity is a function of a Markov process, is discussed. Results similar to those presented can be obtained for any process with conditional stationary independent increments.