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

DOI10.13001/1081-3810.1130zbMath1069.15021OpenAlexW155915199MaRDI QIDQ4656565

Stephen J. Kirkland

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

zbMATH Keywords

condition numberMarkov chaindirected graphgeneralized inversestationary distributionirreducible stochastic matrix

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Stochastic matrices (15B51) Conditioning of matrices (15A12)

Related Items (2)

Fastest expected time to mixing for a Markov chain on a directed graph ⋮ A Structured Condition Number for Kemeny's Constant

This page was built for publication: A combinatorial approach to the conditioning of a single entry in the stationary distribution for a Markov chain