Article contents
Iterative Bounds on the Equilibrium Distribution of a Finite Markov Chain
Published online by Cambridge University Press: 27 July 2009
Abstract
This article presents a new iterative method for computing the equilibrium distribution of a finite Markov chain, which has the significant advantage of providing good upper and lower bounds for the equilibrium probabilities. The method approximates the expected number of visits to each state between two successive visits to a given reference state. Numerical examples indicate that the performance of this method is quite good.
- Type
- Articles
- Information
- Probability in the Engineering and Informational Sciences , Volume 1 , Issue 1 , January 1987 , pp. 117 - 131
- Copyright
- Copyright © Cambridge University Press 1987
References
- 7
- Cited by