Abstract
Let T be an irreducible stochastic matrix, so that we can consider T to be the transition matrix for a Markov chain; one of the central quantities of interest for that chain is the stationary vector for T, i.e. the left Perron vector π t for T, normalized so that its entries sum to 1. It is well-known that in the case that T is primitive then the iterates of the chain converge to π t.
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this paper
Cite this paper
Kirkland, S.J. Digraph-based Conditioning for Markov Chains. In: Benvenuti, L., De Santis, A., Farina, L. (eds) Positive Systems. Lecture Notes in Control and Information Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44928-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-44928-7_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40342-5
Online ISBN: 978-3-540-44928-7
eBook Packages: Springer Book Archive