Random walk in a finite directed graph subject to a road coloring

preprint2010arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.