English
Related papers

Related papers: Quasi-stationary distributions for queueing and ot…

200 papers

The question of recurrence and transience of branching Markov chains is more subtle than for ordinary Markov chains; they can be classified in transience, weak recurrence, and strong recurrence. We review criteria for transience and weak…

Probability · Mathematics 2008-11-12 Sebastian Müller

We propose polynomial-time algorithms to minimise labelled Markov chains whose transition probabilities are not known exactly, have been perturbed, or can only be obtained by sampling. Our algorithms are based on a new notion of an…

Formal Languages and Automata Theory · Computer Science 2021-10-04 Stefan Kiefer , Qiyi Tang

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for…

Probability · Mathematics 2026-02-12 Pablo Groisman , Leonardo T. Rolla , Célio Terra

This paper contributes an in-depth study of properties of continuous time Markov chains (CTMCs) on non-negative integer lattices $\N_0^d$, with particular interest in one-dimensional CTMCs with polynomial transitions rates. Such stochastic…

Probability · Mathematics 2020-06-22 Chuang Xu , Mads Christian Hansen , Carsten Wiuf

The paper studies an improved estimate for the rate of convergence for nonlinear homogeneous discrete-time Markov chains. These processes are nonlinear in terms of the distribution law. Hence, the transition kernels are dependent on the…

Probability · Mathematics 2021-05-21 Aleksandr Shchegolev

Arguing about the equilibrium distribution of continuous-time Markov chains can be vital for showing properties about the underlying systems. For example in biological systems, bistability of a chemical reaction network can hint at its…

Probability · Mathematics 2010-07-20 Tugrul Dayar , Holger Hermanns , David Spieler , Verena Wolf

We are studying stationary random processes with conditional polynomial moments that allow a continuous path modification. Processes with continuous path modification, are important because they are relatively easy to simulate. One does not…

Probability · Mathematics 2024-11-21 Paweł J. Szabłowski

In this paper we consider Markov chains with transition rates that depend on a small parameter $\varepsilon$. Under a mild assumption on the asymptotics of these transition rates, we describe the behavior of the chain at various…

Probability · Mathematics 2017-04-26 Mark Freidlin , Leonid Koralov

This work presents a construction of stationary Markov models with negative-binomial marginal distributions. A simple closed form expression for the corresponding transition probabilities is given, linking the proposal to well-known classes…

Methodology · Statistics 2019-04-10 Fabrizio Leisen , Ramsés H. Mena , Freddy Palma Mancilla , Luca Rossini

For a time-changed symmetric $\alpha$-stable process killed upon hitting zero, under the condition of entrance from infinity, we prove the existence and uniqueness of quasi-stationary distribution (QSD). The exponential convergence to the…

Probability · Mathematics 2023-06-14 Zhe-Kang Fang , Yong-Hua Mao , Tao Wang

We analyze certain stationary fields with linear regressions and quadratic conditional variances. This classic probabilistic problem leads somewhat unexpectedly to stationary Markov processes closely tied to non-commutative probability…

Probability · Mathematics 2007-05-23 Wlodzimierz Bryc

In this paper, we consider a general class of two-time-scale Markov chains whose transition rate matrix depends on a parameter $\lambda>0$. We assume that some transition rates of the Markov chain will tend to infinity as…

Probability · Mathematics 2015-07-10 Chen Jia

The main contribution of this paper is to present a new sufficient condition for the subexponential asymptotics of the stationary distribution of a GI/GI/1-type Markov chain without jumps from level "infinity" to level zero. For simplicity,…

Probability · Mathematics 2014-06-30 Hiroyuki Masuyama

The preparation of the stationary distribution of irreducible, time-reversible Markov chains is a fundamental building block in many heuristic approaches to algorithmically hard problems. It has been conjectured that quantum analogs of…

Quantum Physics · Physics 2015-02-20 Vedran Dunjko , Hans J. Briegel

We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via…

Combinatorics · Mathematics 2015-03-30 Arvind Ayyer , Anne Schilling , Benjamin Steinberg , Nicolas M. Thiery

The theory of $L^2$-spectral gaps for reversible Markov chains has been studied by many authors. In this paper we consider positive recurrent general state space Markov chains with stationary transition probabilities. Replacing the…

Probability · Mathematics 2009-08-07 Achim Wuebker , Zakhar Kabluchko

Consider the following birth and death process with the following infinitesimal transition probabilities {\lambda}(k) ={\lambda}/(1+k) and {\mu}(k) = {\mu}k with {\lambda},{\mu}> 0. This process has known as a discouragement queue [5].…

Probability · Mathematics 2013-02-26 Andrea Monsellato

Let $\{X_n\}$ be a stationary and ergodic time series taking values from a finite or countably infinite set ${\cal X}$. Assume that the distribution of the process is otherwise unknown. We propose a sequence of stopping times $\lambda_n$…

Probability · Mathematics 2008-06-19 G. Morvai , B. Weiss

In this paper, we study consistent and partially exchangeable sequences of Markov chains on a finite state space. We provide a characterisation of the admissible transition rates via a decomposition into individual and coordinated motion of…

Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…

Machine Learning · Computer Science 2023-12-18 Eddie Seabrook , Laurenz Wiskott