Abstract
For a Markov chain with an arbitrary nonempty state space, with stationary finitely additive transition probabilities and with initial distribution concentrated on a recurrent state, it is shown that the probability of every tail set is either zero or one. This generalizes and in particular gives an alternative proof of the result due to Blackwell and Freedman [1] in case the state space is countable and all transition probabilities are countably additive.
Original language | English (US) |
---|---|
Pages (from-to) | 493-497 |
Number of pages | 5 |
Journal | Proceedings of the American Mathematical Society |
Volume | 89 |
Issue number | 3 |
DOIs | |
State | Published - Nov 1983 |
ASJC Scopus subject areas
- Mathematics(all)
- Applied Mathematics