Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)



The tail $ \sigma $-field of a finitely additive Markov chain starting from a recurrent state

Author: S. Ramakrishnan
Journal: Proc. Amer. Math. Soc. 89 (1983), 493-497
MSC: Primary 60F20; Secondary 60J10
MathSciNet review: 715873
Full-text PDF

Abstract | References | Similar Articles | Additional Information

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.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 60F20, 60J10

Retrieve articles in all journals with MSC: 60F20, 60J10

Additional Information

Keywords: Tail $ \sigma $-field, finitely additive probability, Markov chain, recurrent state
Article copyright: © Copyright 1983 American Mathematical Society

American Mathematical Society