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

Kouji Yano ()
Additional contact information
Kouji Yano: Kyoto University

Journal of Theoretical Probability, 2013, vol. 26, issue 1, 259-283

Abstract: 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 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.

Keywords: Stochastic difference equation; Strong solution; Random walk on directed graph; Road coloring; 60J10; 60B15; 05C81; 37H10 (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10959-011-0398-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:26:y:2013:i:1:d:10.1007_s10959-011-0398-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959

DOI: 10.1007/s10959-011-0398-8

Access Statistics for this article

Journal of Theoretical Probability is currently edited by Andrea Monica

More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().