Abstract
For further classification of the states we must introduce new quantities. To employ a vivid language we shall say that the M. C. {x n } is in the state i at the time n or at the n-th step to mean the event {ω: x n (ω) = i}. Similar expressions like starting, entering, returning, avoiding etc.; and also temporal phrases like for the first (or last) time, at least once etc. are to be interpreted in the same spirit.
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
© 1960 Springer-Verlag OHG. Berlin · Göttingen · Heidelberg
About this chapter
Cite this chapter
Chung, K.L. (1960). Recurrence. In: Markov Chains with Stationary Transition Probabilities. Die Grundlehren der Mathematischen Wissenschaften, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-49686-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-49686-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-49408-6
Online ISBN: 978-3-642-49686-8
eBook Packages: Springer Book Archive