It can be seen that a mixture of an exponential distribution and a gamma distribution with increasing failure rate for the right choice of parameters can yield a distribution with a bathtub-shaped failure rate. In this paper we consider a continuous mixture of exponentials and a continuous mixture of gammas with increasing failure rates and show that the resulting mixture has a bathtub-shaped failure rate.

In this paper we propose a framework that facilitates the study of large deviations for point processes based on stationary sequences with regularly varying tails. This framework allows us to keep track both of the magnitude of the extreme values of a process and the order in which these extreme values appear. Particular emphasis is put on (infinite) linear processes with random coefficients. The proposed framework provides a fairly complete description of the joint asymptotic behavior of the large values of the stationary sequence. We apply the general result on large deviations for point processes to derive the asymptotic decay of certain probabilities related to partial sum processes as well as ruin probabilities.

This paper is concerned with properties of the algebraic degree of the Laplace-Stieltjes transform of phase-type (PH) distributions. The main problem of interest is: given a PH generator, how do we find the maximum and the minimum algebraic degrees of all irreducible PH representations with that PH generator? Based on the matrix exponential (ME) order of ME distributions and the spectral polynomial algorithm, a method for computing the algebraic degree of a PH distribution is developed. The maximum algebraic degree is identified explicitly. Using Perron-Frobenius theory of nonnegative matrices, a lower bound and an upper bound on the minimum algebraic degree are found, subject to some conditions. Explicit results are obtained for special cases.

We consider the problem of efficient estimation via simulation of first passage time probabilities for a multidimensional random walk with heavy-tailed increments. In addition to being a natural generalization to the problem of computing ruin probabilities in insurance - in which the focus is the maximum of a one-dimensional random walk with negative drift - this problem captures important features of large deviations for multidimensional heavy-tailed processes (such as the role played by the mean of the process in connection to the location of the target set). We develop a state-dependent importance sampling estimator for this class of multidimensional problems. Then, using techniques based on Lyapunov inequalities, we argue that our estimator is strongly efficient in the sense that the relative mean squared error of our estimator can be made arbitrarily small by increasing the number of replications, uniformly as the probability of interest approaches 0.

Consider a monoecious diploid population with nonoverlapping generations, whose size varies with time according to an irreducible, aperiodic Markov chain with states x1N,…,xKN, where K ≪ N. It is assumed that all matings except for selfing are possible and equally probable. At time 0 a random sample of n ≪ N genes is taken. Given two successive population sizes xjN and xiN, the numbers of gametes that individual parents contribute to offspring can be shown to be exchangeable random variables distributed as Gij. Under minimal conditions on the first three moments of Gij for all i and j, a suitable effective population size Ne is derived. Then if time is recorded in a backward direction in units of 2Ne generations, it can be shown that coalescent theory holds.

A sequence of random variables is said to be extended negatively dependent (END) if the tails of its finite-dimensional distributions in the lower-left and upper-right corners are dominated by a multiple of the tails of the corresponding finite-dimensional distributions of a sequence of independent random variables with the same marginal distributions. The goal of this paper is to establish the strong law of large numbers for a sequence of END and identically distributed random variables. In doing so we derive some new inequalities of large deviation type for the sums of END and identically distributed random variables being suitably truncated. We also show applications of our main result to risk theory and renewal theory.

In this paper we consider the probabilities of finite- and infinite-time absolute ruins in the renewal risk model with constant premium rate and constant force of interest. In the particular case of the compound Poisson model, explicit asymptotic expressions for the finite- and infinite-time absolute ruin probabilities are given. For the general renewal risk model, we present an asymptotic expression for the infinite-time absolute ruin probability. Conditional distributions of Poisson processes and probabilistic techniques regarding randomly weighted sums are employed in the course of this study.

In this paper we consider the problem of identifiability for the two-state Markovian arrival process (MAP2). In particular, we show that the MAP2 is not identifiable, providing the conditions under which two different sets of parameters induce identical stationary laws for the observable process.

The aim of this paper is to study the stochastic monotonicity and continuity properties of the extinction time of Bellman-Harris branching processes depending on their reproduction laws. Moreover, we show their applications in an epidemiological context, obtaining an optimal criterion to establish the proportion of susceptible individuals in a given population that must be vaccinated in order to eliminate an infectious disease. First the spread of infection is modelled by a Bellman-Harris branching process. Finally, we provide a simulation-based method to determine the optimal vaccination policies.

We study a stochastic differential game between two insurance companies who employ reinsurance to reduce the risk of exposure. Under the assumption that the companies have large insurance portfolios compared to any individual claim size, their surplus processes can be approximated by stochastic differential equations. We formulate competition between the two companies as a game with a single payoff function which depends on the surplus processes. One company chooses a dynamic reinsurance strategy in order to maximize this expected payoff, while the other company simultaneously chooses a dynamic reinsurance strategy so as to minimize the same quantity. We describe the Nash equilibrium of this stochastic differential game and solve it explicitly for the case of maximizing/minimizing the exit probability.

We present conditions that imply the conditional full support (CFS) property, introduced in Guasoni, Rásonyi and Schachermayer (2008), for processes Z := H + ∫K dW, where W is a Brownian motion, H is a continuous process, and processes H and K are either progressive or independent of W. Moreover, in the latter case, under an additional assumption that K is of finite variation, we present conditions under which Z has CFS also when W is replaced with a general continuous process with CFS. As applications of these results, we show that several stochastic volatility models and the solutions of certain stochastic differential equations have CFS.

In this paper we study the moment generating function order and the new better than used in the moment generating function order (NBUMG) life distributions. A closure property of this order under an independent random sum is deduced, and stochastic comparisons among the block replacement policy, the age replacement policy, the complete repair policy, and the minimal repair policy of an NBUMG component are investigated.

Quasi-stationary distributions, as discussed in Darroch and Seneta (1965), have been used in biology to describe the steady state behaviour of population models which, while eventually certain to become extinct, nevertheless maintain an apparent stochastic equilibrium for long periods. These distributions have some drawbacks: they need not exist, nor be unique, and their calculation can present problems. In this paper, we give biologically plausible conditions under which the quasi-stationary distribution is unique, and can be closely approximated by distributions that are simple to compute.

We investigate the tail behaviour of the steady-state distribution of a stochastic recursion that generalises Lindley's recursion. This recursion arises in queueing systems with dependent interarrival and service times, and includes alternating service systems and carousel storage systems as special cases. We obtain precise tail asymptotics in three qualitatively different cases, and compare these with existing results for Lindley's recursion and for alternating service systems.

We consider a Poisson cluster model, motivated by insurance applications. At each claim arrival time, modeled by the point of a homogeneous Poisson process, we start a cluster process which represents the number or amount of payments triggered by the arrival of a claim in a portfolio. The cluster process is a Lévy or truncated compound Poisson process. Given the observations of the process over a finite interval, we consider the expected value of the number and amount of payments in a future time interval. We also give bounds for the error encountered in this prediction procedure.

Let {Xn, n ≥ 1} be an independent, identically distributed random sequence with each Xn having the general error distribution. In this paper we derive the exact uniform convergence rate of the distribution of the maximum to its extreme value limit.

We introduce and motivate the study of (n + 1) × r arrays X with Bernoulli entries Xk,j and independently distributed rows. We study the distribution of which denotes the number of consecutive pairs of successes (or runs of length 2) when reading the array down the columns and across the rows. With the case r = 1 having been studied by several authors, and permitting some initial inferences for the general case r > 1, we examine various distributional properties and representations of Sn for the case r = 2, and, using a more explicit analysis, the case of multinomial and identically distributed rows. Applications are also given in cases where the array X arises from a Pólya sampling scheme.

In this paper we present a method to recover a time-homogeneous piecewise constant volatility from a finite set of perpetual put option prices. The whole calculation process of the volatility is decomposed into easy computations in many fixed disjoint intervals. In each interval, the volatility is obtained by solving a system of nonlinear equations.

The purpose of this paper is to study an optimal stopping problem with constraints for a Markov chain with general state space by using the convex analytic approach. The costs are assumed to be nonnegative. Our model is not assumed to be transient or absorbing and the stopping time does not necessarily have a finite expectation. As a consequence, the occupation measure is not necessarily finite, which poses some difficulties in the analysis of the associated linear program. Under a very weak hypothesis, it is shown that the linear problem admits an optimal solution, guaranteeing the existence of an optimal stopping strategy for the optimal stopping problem with constraints.

We introduce a stochastic process that describes a finite-velocity damped motion on the real line. Differently from the telegraph process, the random times between consecutive velocity changes have exponential distribution with linearly increasing parameters. We obtain the probability law of the motion, which admits a logistic stationary limit in a special case. Various results on the distributions of the maximum of the process and of the first passage time through a constant boundary are also given.