A combinatorial approach to the conditioning of a single entry in the stationary distribution for a Markov chain

Electronic Journal of Linear Algebra

Volumn 11, Issue , 2004, Pages 168-179

  Kirkland, S ^a  

^a UNIVERSITY OF REGINA   (Canada)

Author keywords

Condition number; Directed graph; Markov chain; Stationary vector; Stochastic matrix

Indexed keywords

EID: 4644343844     PISSN: 10813810     EISSN: None     Source Type: Journal    
DOI: 10.13001/1081-3810.1130     Document Type: Article

References (9)

1. R. Brualdi and H. Ryser. Combinatorial Matrix Theory. Cambridge University Press, Cambridge, 1991.
2. S. Campbell and C. Meyer. Generalized Inverses of Linear Transformations. Dover, New York, 1991.
3. G. Cho and C. Meyer. Comparison of perturbation bounds for the stationary distribution of a Markov chain. Linear Algebra and its Applications, 335:137-150, 2001.
4. S. Kirkland. On a question concerning condition numbers for Markov chains. SIAM Journal on Matrix Analysis and Applications, 23:1109-1119, 2002.
5. S. Kirkland. Conditioning properties of the stationary distribution for a Markov chain. Electronic Journal of Linear Algebra, 10:1-15, 2003.
6. S. Kirkland. Digraph-based conditioning for Markov chains. Linear Algebra and its Applications, 385:81-93, 2004.
7. S. Kirkland, M. Neumann, and B. Shader. Applications of Paz's inequality to perturbation bounds for Markov chains. Linear Algebra and its Applications, 268:183-196, 1998.
8. C. Meyer. The condition of a finite Markov chain and perturbation bounds for the limiting probabilities. SIAM Journal on Discrete and Algebraic Methods, 1:273-283, 1980.
9. E. Seneta. Non-negative Matrices and Markov Chains. Springer-Verlag, New York, 1981.