Conditions for strong ergodicity using intensity matrices

1988 ◽  
Vol 25 (1) ◽  
pp. 34-42 ◽  
Author(s):  
Jean Johnson ◽  
Dean Isaacson

Sufficient conditions for strong ergodicity of discrete-time non-homogeneous Markov chains have been given in several papers. Conditions have been given using the left eigenvectors ψn of Pn(ψ nPn = ψ n) and also using the limiting behavior of Pn. In this paper we consider the analogous results in the case of continuous-time Markov chains where one uses the intensity matrices Q(t) instead of P(s, t). A bound on the rate of convergence of certain strongly ergodic chains is also given.

1988 ◽  
Vol 25 (01) ◽  
pp. 34-42 ◽  
Author(s):  
Jean Johnson ◽  
Dean Isaacson

Sufficient conditions for strong ergodicity of discrete-time non-homogeneous Markov chains have been given in several papers. Conditions have been given using the left eigenvectors ψ n of Pn (ψ nPn = ψ n ) and also using the limiting behavior of Pn. In this paper we consider the analogous results in the case of continuous-time Markov chains where one uses the intensity matrices Q(t) instead of P(s, t). A bound on the rate of convergence of certain strongly ergodic chains is also given.


1978 ◽  
Vol 15 (4) ◽  
pp. 699-706 ◽  
Author(s):  
Dean Isaacson ◽  
Barry Arnold

The concept of strong ergodicity for discrete-time homogeneous Markov chains has been characterized in several ways (Dobrushin (1956), Lin (1975), Isaacson and Tweedie (1978)). In this paper the characterization using mean visit times (Huang and Isaacson (1977)) is extended to continuous-time Markov chains. From this it follows that for a certain subclass of continuous-time Markov chains, X(t), is strongly ergodic if and only if the associated embedded chain is Cesaro strongly ergodic.


1978 ◽  
Vol 15 (04) ◽  
pp. 699-706 ◽  
Author(s):  
Dean Isaacson ◽  
Barry Arnold

The concept of strong ergodicity for discrete-time homogeneous Markov chains has been characterized in several ways (Dobrushin (1956), Lin (1975), Isaacson and Tweedie (1978)). In this paper the characterization using mean visit times (Huang and Isaacson (1977)) is extended to continuous-time Markov chains. From this it follows that for a certain subclass of continuous-time Markov chains, X(t), is strongly ergodic if and only if the associated embedded chain is Cesaro strongly ergodic.


1992 ◽  
Vol 29 (04) ◽  
pp. 838-849 ◽  
Author(s):  
Thomas Hanschke

This paper deals with a class of discrete-time Markov chains for which the invariant measures can be expressed in terms of generalized continued fractions. The representation covers a wide class of stochastic models and is well suited for numerical applications. The results obtained can easily be extended to continuous-time Markov chains.


1993 ◽  
Vol 30 (3) ◽  
pp. 518-528 ◽  
Author(s):  
Frank Ball ◽  
Geoffrey F. Yeo

We consider lumpability for continuous-time Markov chains and provide a simple probabilistic proof of necessary and sufficient conditions for strong lumpability, valid in circumstances not covered by known theory. We also consider the following marginalisability problem. Let {X{t)} = {(X1(t), X2(t), · ··, Xm(t))} be a continuous-time Markov chain. Under what conditions are the marginal processes {X1(t)}, {X2(t)}, · ··, {Xm(t)} also continuous-time Markov chains? We show that this is related to lumpability and, if no two of the marginal processes can jump simultaneously, then they are continuous-time Markov chains if and only if they are mutually independent. Applications to ion channel modelling and birth–death processes are discussed briefly.


2003 ◽  
Vol 40 (04) ◽  
pp. 970-979 ◽  
Author(s):  
A. Yu. Mitrophanov

For finite, homogeneous, continuous-time Markov chains having a unique stationary distribution, we derive perturbation bounds which demonstrate the connection between the sensitivity to perturbations and the rate of exponential convergence to stationarity. Our perturbation bounds substantially improve upon the known results. We also discuss convergence bounds for chains with diagonalizable generators and investigate the relationship between the rate of convergence and the sensitivity of the eigenvalues of the generator; special attention is given to reversible chains.


1989 ◽  
Vol 26 (3) ◽  
pp. 643-648 ◽  
Author(s):  
A. I. Zeifman

We consider a non-homogeneous continuous-time Markov chain X(t) with countable state space. Definitions of uniform and strong quasi-ergodicity are introduced. The forward Kolmogorov system for X(t) is considered as a differential equation in the space of sequences l1. Sufficient conditions for uniform quasi-ergodicity are deduced from this equation. We consider conditions of uniform and strong ergodicity in the case of proportional intensities.


2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Mokaedi V. Lekgari

We investigate random-time state-dependent Foster-Lyapunov analysis on subgeometric rate ergodicity of continuous-time Markov chains (CTMCs). We are mainly concerned with making use of the available results on deterministic state-dependent drift conditions for CTMCs and on random-time state-dependent drift conditions for discrete-time Markov chains and transferring them to CTMCs.


2005 ◽  
Vol 42 (1) ◽  
pp. 52-60 ◽  
Author(s):  
Fátima Ferreira ◽  
António Pacheco

As proposed by Irle and Gani in 2001, a process X is said to be slower in level crossing than a process Y if it takes X stochastically longer to exceed any given level than it does Y. In this paper, we extend a result of Irle (2003), relative to the level crossing ordering of uniformizable skip-free-to-the-right continuous-time Markov chains, to derive a new set of sufficient conditions for the level crossing ordering of these processes. We apply our findings to birth-death processes with and without catastrophes, and M/M/s/c systems.


Sign in / Sign up

Export Citation Format

Share Document