Random walks on colored graphs
From MaRDI portal
Publication:4286296
Recommendations
Cites work
- scientific article; zbMATH DE number 4087055 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- Definite and Quasidefinite Sets of Stochastic Matrices
- Eigenvalues and expanders
- Finite state verifiers I
- Non-negative matrices and Markov chains.
- Products of Indecomposable, Aperiodic, Stochastic Matrices
- Proof of Shannon's Transmission Theorem for Finite-State Indecomposable Channels
- Relationships between nondeterministic and deterministic tape complexities
- Space-bounded probabilistic game automata
Cited in
(6)- Painting a graph with competing random walks
- Random walk in a finite directed graph subject to a road coloring
- Edge flipping in graphs
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities
- Toward a theory of Markov influence systems and their renormalization
This page was built for publication: Random walks on colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286296)