Markov Approximations of chains of infinite order in the $\bar{d}$-metric

Abstract

We derive explicit upper bounds for the $\bar{d}$-distance between a chain of infinite order and its canonical $k$-steps Markov approximation. Our proof is entirely constructive and involves a "coupling from the past" argument. The new method covers non necessarily continuous probability kernels, and chains with null transition probabilities. These results imply in particular the Bernoulli property for these processes.

arXiv comment24 pages and 2 figures. Complete revision of the previous version

Cited by in corpus (1)

• Rumor processes on $\mathbb{N}$ and discrete renewal processes