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

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

2011-05-05

arxiv.org/abs/1105.1095v1

Mathematics

Probability

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Random walk in a finite directed graph subject to a synchronizing road coloring does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random walk in a finite directed graph subject to a synchronizing road coloring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random walk in a finite directed graph subject to a synchronizing road coloring will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-691002