Abstract
Recurrence and transience properties have already been examined in Chapter 6 and 7 for atomic and discrete Markov chains. We revisit these notions for irreducible Markov chains. Some of the properties we have shown for atomic chains extend quite naturally to irreducible chains. This is in particular true of the dichotomy between recurrent and transient chains (compare Theorem 6.2.7 or Theorem 7.1.2 with Theorem 10.1.5 below).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Douc, R., Moulines, E., Priouret, P., Soulier, P. (2018). Transience, Recurrence, and Harris Recurrence. In: Markov Chains. Springer Series in Operations Research and Financial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-97704-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-97704-1_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-97703-4
Online ISBN: 978-3-319-97704-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)