Iterative Bounds on the Equilibrium Distribution of a Finite Markov Chain

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.

This publication has 1 reference indexed in Scilit: