SearcharxivSearch

arXiv · 2407.07440

One-sided Markov additive processes with lattice and non-lattice increments

Abstract

Dating from the work of Neuts in the 1980s, the field of matrix-analytic methods has been developed to analyse discrete or continuous-time Markov chains with a two-dimensional state space in which the increment of a level variable is governed by an auxiliary phase variable. More recently, matrix-analytic techniques have been applied to general Markov additive models with a finite phase space. The basic assumption underlying these developments is that the process is skip-free (in the case of QBDs or fluid queues) or that it is one-sided, that is it is jump-free in one direction. From the Markov additive perspective, traditional matrix-analytic models can be viewed as special cases: for M/G/1 and GI/M/1-type Markov chains, increments in the level are constrained to be lattice random variables and for fluid queues, they have to be piecewise linear. In this paper we discuss one-sided lattice and non-lattice Markov additive processes in parallel. Results that are standard in one tradition are interpreted in the other, and new perspectives emerge. In particular, using three fundamental matrices, we address hitting, two-sided exit, and creeping probabilities.

Explore related subjects

Keep this discovery

BibTeXRIS

Jevgenijs Ivanovs, Guy Latouche, Peter Taylor. 2024-07-10. One-sided Markov additive processes with lattice and non-lattice increments. https://arxiv.org/abs/2407.07440

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR