A Zero-One Law for Markov Chains
Probability
2020-11-10 v1
Abstract
We prove an analog of the classical Zero-One Law for both homogeneous and nonhomogeneous Markov chains (MC). Its almost precise formulation is simple: given any event from the tail -algebra of MC , for large , with probability near one, the trajectories of the MC are in states , where is either near or near . A similar statement holds for the entrance -algebra, when tends to . To formulate this second result, we give detailed results on the existence of nonhomogeneous Markov chains indexed by or in both the finite and countable cases. This extends a well-known result due to Kolmogorov. Further, in our discussion, we note an interesting dichotomy between two commonly used definitions of MCs.
Keywords
Cite
@article{arxiv.2011.04063,
title = {A Zero-One Law for Markov Chains},
author = {Michael Grabchak and Isaac Sonin},
journal= {arXiv preprint arXiv:2011.04063},
year = {2020}
}