Article contents
COMPUTABLE STRONGLY ERGODIC RATES OF CONVERGENCE FOR CONTINUOUS-TIME MARKOV CHAINS
Published online by Cambridge University Press: 01 April 2008
Abstract
In this paper, we investigate computable lower bounds for the best strongly ergodic rate of convergence of the transient probability distribution to the stationary distribution for stochastically monotone continuous-time Markov chains and reversible continuous-time Markov chains, using a drift function and the expectation of the first hitting time on some state. We apply these results to birth–death processes, branching processes and population processes.
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 2008
References
- 6
- Cited by