Random Walk in a Finite Directed Graph Subject to a Road Coloring

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 process is proved to be that the road coloring is synchronizing. The key to the proof is to find a hidden symmetry in the non-synchronizing case.

[1]  K. Yasutomi,et al.  Realization of an ergodic Markov chain as a random walk subject to a synchronizing road coloring , 2011 .

[2]  Stochastic equations on compact groups in discrete negative time , 2006, math/0603113.

[3]  Realization of finite-state mixing Markov chain as a random walk subject to a synchronizing road coloring , 2010, 1006.0534.

[4]  M. Rosenblatt.  Limits of Convolution Sequences of Measures on a Compact Topological Semigroup , 1960 .

[5]  A. N. Trahtman,et al.  The road coloring problem , 2007, 0709.0099.

[6]  W. Woess.  Random walks on infinite graphs and groups, by Wolfgang Woess, Cambridge Tracts , 2001 .

[7]  Philip Feinsilver,et al.  The generalized road coloring problem and periodic digraphs , 2009, Applicable Algebra in Engineering, Communication and Computing.

[8]  P. Feinsilver,et al.  Completely Simple Semigroups, Lie Algebras, and the Road Coloring Problem , 2007 .

[9]  Jarkko Kari,et al.  A Note on Synchronized Automata and Road Coloring Problem , 2002, Int. J. Found. Comput. Sci..

[10]  Arunava Mukherjea,et al.  Probability Measures on Semigroups , 1995 .

[11]  K. Yano,et al.  Strong solutions of Tsirel’son’s equation in discrete time taking values in compact spaces with semigroup action , 2010, 1005.0038.

[12]  E. Seneta.  Non-negative Matrices and Markov Chains , 2008 .

[13]  Benjamin Weiss,et al.  SIMILARITY OF AUTOMORPHISMS OF THE TORUS , 1970 .

[14]  Around Tsirelson's equation, or: The evolution process may not explain everything , 2009, 0906.3442.

[15]  Dominique Perrin,et al.  A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata , 2011, Int. J. Found. Comput. Sci..

[16]  Tsirel'son's equation in discrete time , 1992 .

[17]  B. Tsirelson.  An Example of a Stochastic Differential Equation Having No Strong Solution , 1976 .

[18]  A. Mukherjea,et al.  Convergence of products of independent random variables with values in a discrete semigroup , 1979 .

[19]  Greg Budzban,et al.  Semigroups and the Generalized Road Coloring Problem , 2004 .

[20]  K. Yano,et al.  Extremal solutions for stochastic equations indexed by negative integers and taking values in compact groups , 2009, 0907.2587.

[21]  E. Seneta.  Non-negative Matrices and Markov Chains (Springer Series in Statistics) , 1981 .

[22]  A. Trahtman.  A partially synchronizing coloring , 2010, 2206.07116.

[23]  Benjamin Weiss,et al.  Equivalence of topological Markov shifts , 1977 .

[24]  矢野 孝次（京都大学数理解析研究所）.  Time evolution with and without remote past , 2006 .