Random walk in a finite directed graph subject to a synchronizing road coloring
classification
🧮 math.PR
keywords
coloringrandomroadsubjectsynchronizingwalkchainconstructive
read the original abstract
A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.