Random walk in a finite directed graph subject to a road coloring
classification
🧮 math.PR
keywords
roadcoloringrandomsubjectwalkdirectedfinitegraph
read the original abstract
A necessary and sufficient condition for a random walk in a finite directed graph subject to a road coloring to be measurable with respect to the driving random road colors is proved to be that the road coloring is synchronizing. For this, the random walk subject to a non-synchronizing road coloring is proved to have uniform law on a certain partition of the state space.
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.