Abstract
Recall that a transient Markov chain is a Markov chain all of whose recurrent states are absorbing. Its transition matrix satisfiesP1 ≤ 1. For any transient state j in the chain, we have seen that \(\overline {{H_{jj}}} < 1\) and N ij < +∞ for every i. If E is any set of states, we can put the transition matrix in the canonical form
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Kemeny, J.G., Snell, J.L., Knapp, A.W. (1976). Transient Chains. In: Denumerable Markov Chains. Graduate Texts in Mathematics, vol 40. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9455-6_5
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9455-6_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-9457-0
Online ISBN: 978-1-4684-9455-6
eBook Packages: Springer Book Archive