Coupling from the Past for the Null Recurrent Markov Chain
Fran\c{c}ois Baccelli, Mir-Omid Haji-Mirsadeghi, Sayeh Khaniha

TL;DR
This paper investigates the structure of the Bridge Doeblin Graph for null recurrent Markov chains, revealing it as either an infinite tree or a forest of trees, and explores implications for measure-valued dynamics.
Contribution
It extends the understanding of the Bridge Doeblin Graph to null recurrent chains, characterizing its structure and properties, and analyzes related measure-valued dynamics.
Findings
Bridge Doeblin Graph is either an infinite tree or a forest of trees.
The infinite tree has a single end and is locally unimodular.
Applications to taboo and potential random dynamics are discussed.
Abstract
The Doeblin Graph of a countable state space Markov chain describes the joint pathwise evolutions of the Markov dynamics starting from all possible initial conditions, with two paths coalescing when they reach the same point of the state space at the same time. Its Bridge Doeblin subgraph only contains the paths starting from a tagged point of the state space at all possible times. In the irreducible, aperiodic, and positive recurrent case, the following results are known: the Bridge Doeblin Graph is an infinite tree that is unimodularizable. Moreover, it contains a single bi-infinite path, which allows one to build a perfect sample of the stationary state of the Markov chain. The present paper is focused on the null recurrent case. It is shown that when assuming irreducibility and aperiodicity again, the Bridge Doeblin Graph is either an infinite tree or a forest made of a countable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Mathematical Dynamics and Fractals · Cellular Automata and Applications
