Mixing times with applications to perturbed Markov chains

Linear Algebra and Its Applications

Volumn 417, Issue 1 SPEC. ISS., 2006, Pages 108-123

  Hunter, Jeffrey J ^a  

^a MASSEY UNIVERSITY   (New Zealand)

Author keywords

Markov chains; Mean first passage times; Mixing times; Perturbation theory; Stationary distribution; Time to stationarity

Indexed keywords

LINEAR ALGEBRA; OPTIMIZATION; PERTURBATION TECHNIQUES; PROBABILITY; STATISTICAL METHODS; VECTORS;

MEAN FIRST PASSAGE TIMES; MIXING TIMES; STATIONARY DISTRIBUTION; TIME TO STATIONARITY;

MARKOV PROCESSES;

EID: 33745523822     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.02.008     Document Type: Article

References (18)

1. D.J. Aldous, J.A. Fill, Reversible Markov Chains and Random Walks on Graphs, in preparation. Available from: .
2. Cao X.-R. The Malaurin series for performance functions of Markov chains. Adv. Appl. Prob. 30 (1998) 676-692
3. Cho G.E., and Meyer C.D. Comparison of perturbation bounds for a stationary distribution of a Markov chain. Linear Algebra Appl. 335 (2001) 137-150
4. Cho G.E., and Meyer C.D. Markov chain sensitivity measured by mean first passage time. Linear Algebra Appl. 316 (2000) 21-28
5. Hunter J.J. Stationary distributions and mean first passage times of perturbed Markov chains. Linear Algebra Appl. 410 (2005) 217-243
6. Hunter J.J. Stationary distributions and mean first passage times in Markov chains using generalised inverses. Asia-Pacific J. Oper. Res. 9 (1992) 145-153
7. Hunter J.J. Mathematical Techniques of Applied Probability. Discrete Time Models: Basic Theory vol. 1 (1983), Academic, New York
8. Hunter J.J. Mathematical Techniques of Applied Probability. Discrete Time Models: Techniques and Applications vol. 2 (1983), Academic, New York
9. Hunter J.J. Generalized inverses and their application to applied probability problems. Linear Algebra Appl. 45 (1982) 157-198
10. Kemeny J.G., and Snell J.L. Finite Markov Chains (1960), Van Nostrand, New York
11. Lovasz L., and Winkler P. Mixing Times. In: Aldous D., and Propp J. (Eds). Microsurveys in Discrete Probability. DIMACS Series in Discrete Math. and Theor. Comput. Sci. (1998), AMS 85-133
12. Meyer C.D. The condition of a finite Markov chain and perturbation bounds for the limiting probabilities. SIAM J. Algebraic Discrete Methods 1 (1980) 273-283
13. Meyer C.D. The role of the group generalized inverse in the theory of finite Markov chains. SIAM Rev. 17 (1975) 443-464
14. Paige C.C., Styan G.P.H., and Wachter P.G. Computation of the stationary distribution of a Markov chain. J. Statist. Comput. Simulation 4 (1975) 173-186
15. Schweitzer P. Perturbation theory and finite Markov chains. J. Appl. Probab. 5 (1968) 410-413
16. Seneta E. Perturbation of the stationary distribution measured by the ergodicity coefficients. Adv. Appl. Prob. 20 (1988) 228-230
17. Seneta E. Sensitivity analysis, ergodicity coefficients, and rank-one updates for finite Markov chains. In: Stewart W.J. (Ed). Numerical Solution of Markov Chains, Probability: Pure and Applied (1991), Marcel-Dekker, New York 121-129
18. G.P.H. Styan, Selected topics in Markov chain theory with an application to marketing, MA thesis, Columbia University, 1964.