Abstract
An ergodic Markov chain is proved to be the realization of a random walk in a directed graph subject to a synchronizing road coloring. The result ensures the existence of appropriate random mappings in Propp-Wilson's coupling from the past. The proof is based on the road coloring theorem. A necessary and sufficient condition for approximate preservation of entropies is also given.
Citation
Kouji Yano. Kenji Yasutomi. "Realization of an ergodic Markov chain as a random walk subject to a synchronizing road coloring." J. Appl. Probab. 48 (3) 766 - 777, September 2011. https://doi.org/10.1239/jap/1316796913
Information