A combinatorial approach to the conditioning of a single entry in the stationary distribution for a Markov chain
From MaRDI portal
Publication:4656565
DOI10.13001/1081-3810.1130zbMath1069.15021MaRDI QIDQ4656565
Publication date: 11 March 2005
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/125004
condition number; Markov chain; directed graph; generalized inverse; stationary distribution; irreducible stochastic matrix
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C20: Directed graphs (digraphs), tournaments
15B51: Stochastic matrices
15A12: Conditioning of matrices
Related Items
A Structured Condition Number for Kemeny's Constant, Fastest expected time to mixing for a Markov chain on a directed graph
