Random walk in a finite directed graph subject to a road coloring
From MaRDI portal
Publication:742112
DOI10.1007/S10959-011-0398-8zbMath1296.60190arXiv1005.0079OpenAlexW2037539090WikidataQ58331041 ScholiaQ58331041MaRDI QIDQ742112
Publication date: 18 September 2014
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.0079
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Generation, random and stochastic difference and differential equations (37H10) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Random walks on graphs (05C81)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The generalized road coloring problem and periodic digraphs
- Around Tsirelson's equation, or: the evolution process may not explain everything
- Semigroups and the generalized road coloring problem
- The road coloring problem
- Extremal solutions for stochastic equations indexed by negative integers and taking values in compact groups
- Tsirel'son's equation in discrete time
- Equivalence of topological Markov shifts
- Stochastic equations on compact groups in discrete negative time
- Probability Measures on Semigroups
- A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
- Realization of an Ergodic Markov Chain as a Random Walk Subject to a Synchronizing Road Coloring
- A Partially Synchronizing Coloring
- On the Road Coloring Problem
- Convergence of products of independent random variables with values in a discrete semigroup
- Random Walks on Infinite Graphs and Groups
- Similarity of automorphisms of the torus
This page was built for publication: Random walk in a finite directed graph subject to a road coloring
