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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
