Journal of Applied Probability
- J. Appl. Probab.
- Volume 48, Number 3 (2011), 766-777.
Realization of an ergodic Markov chain as a random walk subject to a synchronizing road coloring
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.
J. Appl. Probab., Volume 48, Number 3 (2011), 766-777.
First available in Project Euclid: 23 September 2011
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 37A35: Entropy and other invariants, isomorphism, classification 05C81: Random walks on graphs 37H10: Generation, random and stochastic difference and differential equations [See also 34F05, 34K50, 60H10, 60H15]
Yano, Kouji; Yasutomi, Kenji. Realization of an ergodic Markov chain as a random walk subject to a synchronizing road coloring. J. Appl. Probab. 48 (2011), no. 3, 766--777. doi:10.1239/jap/1316796913. https://projecteuclid.org/euclid.jap/1316796913