Abstract
Consider a Markov chain taking its values in E = N. There is a possibility that for any initial state i ∈ N the chain will never visit i after some finite random time. This is often an undesirable feature.
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
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Brémaud, P. (2020). Recurrence and Ergodicity. In: Markov Chains. Texts in Applied Mathematics, vol 31. Springer, Cham. https://doi.org/10.1007/978-3-030-45982-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-45982-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-45981-9
Online ISBN: 978-3-030-45982-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)