A Zero-One Law for Virtual Markov Chains
Abstract
A virtual Markov chain (VMC) is a sequence \XN\N=0∞ of Markov chains (MCs) coupled together on the same probability space such that XN has state space \0,1,…, N\ and such that removing all instances of N~+~1 from the sample path of XN+1 results in the sample path of XN almost surely. In this paper, we prove an exact characterization of the triviality of the σ-algebra N=0∞σ(XN,XN+1,…). The main tool for doing this is a decomposition theorem that the σ-algebra generated by a VMC is equal to the σ-algebra generated by a certain countably infinite collection of independent constituent MCs. These constituents are so-called staircase MCs (SMCs), which are defined to be inhomoheneous Markov chains on the non-negative integers which transition only by holding or by jumping to a value equal to the current index. We also develop some general aspects of the theory of SMCs, including a connection with some classical but very much under-appreciated aspects of convex analysis.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.