Iterative bounds on the equilibrium distribution of a finite Markov chain. (English) Zbl 1133.60330

Summary: 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.


60G99 Stochastic processes
Full Text: DOI


[1] DOI: 10.1137/1009030 · Zbl 0154.45101
[2] Doob, Stochastic Processes pp 173– (1953)
[3] DOI: 10.1007/BF01386313 · Zbl 0107.33301
[4] Aitken, Proc. Royal Soc. Edinburgh 63 pp 52– (1950)
[5] DOI: 10.1007/BF02932554
[6] Varga, Matrix Iterative Analysis pp 70– (1962) · Zbl 0133.08602
[7] Seneta, Nonnegative Matrices and Markov Chains (1980)
[8] DOI: 10.1016/0022-247X(71)90094-1 · Zbl 0218.90070
[9] DOI: 10.1007/BF01949684 · Zbl 0288.90085
[10] Porteus, Mgmt. Science 18 pp 7– (1971)
[11] Porteus, Oper. Res. 26 pp 350– (1978)
[12] Pease, Methods of Matrix Algebra (1965) · Zbl 0145.03701
[13] Kemeny, Finite Markov Chains pp 46– (1976)
[14] DOI: 10.1093/imamat/15.3.351 · Zbl 0307.65042
[15] Berman, Nonnegative Matrices in the Mathematical Sciences (1979) · Zbl 0484.15016
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.