We illustrate how Basu's theorem can be used to derive the spatial version of the Wiener-Hopf factorization for a specific class of piecewise-deterministic Markov processes. The classical factorization results for both random walks and Lévy processes follow immediately from our result. The approach is particularly elegant when used to establish the factorization for spectrally one-sided Lévy processes.

In this paper we study the Wiener-Hopf factorization for a class of Lévy processes with double-sided jumps, characterized by the fact that the density of the Lévy measure is given by an infinite series of exponential functions with positive coefficients. We express the Wiener-Hopf factors as infinite products over roots of a certain transcendental equation, and provide a series representation for the distribution of the supremum/infimum process evaluated at an independent exponential time. We also introduce five eight-parameter families of Lévy processes, defined by the fact that the density of the Lévy measure is a (fractional) derivative of the theta function, and we show that these processes can have a wide range of behavior of small jumps. These families of processes are of particular interest for applications, since the characteristic exponent has a simple expression, which allows efficient numerical computation of the Wiener-Hopf factors and distributions of various functionals of the process.

We show that the positive Wiener-Hopf factor of a Lévy process with positive jumps having a rational Fourier transform is a rational function itself, expressed in terms of the parameters of the jump distribution and the roots of an associated equation. Based on this, we give the closed form of the ruin probability for a Lévy process, with completely arbitrary negatively distributed jumps, and finite intensity positive jumps with a distribution characterized by a rational Fourier transform. We also obtain results for the ladder process and its Laplace exponent. A key role is played by the analytic properties of the characteristic exponent of the process and by a Baxter-Donsker-type formula for the positive factor that we derive.

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.

Previous work in extending Wald's equations to Markov random walks involves finiteness of moment generating functions and uniform recurrence assumptions. By using a new approach, we can remove these assumptions. The results are applied to establish finiteness of moments of ladder variables and to derive asymptotic expansions for expected first passage times of Markov random walks. Wiener–Hopf factorizations for Markov random walks are also applied to analyse ladder variables and related first passage problems.

Two Wiener-Hopf type factorization identities for multivariate distributions are introduced. Properties of associated stopping times are derived. The structure that produces one factorization also provides the unique solution of the Wiener-Hopf convolution equation on a convex cone in Rd. Some applications for multivariate storage and queueing systems are indicated. For a few cases explicit formulas are obtained for the transforms of the associated stopping times. A result of Kemperman is extended.

A single server faces a renewal stream of low and another one of high priority customers, one of them being a Poisson stream. For the preemptive resume and head-of-the line disciplines the transient behaviour of the queue is studied. Various limiting distributions are also obtained.