Random walks on colored graphs

DOI10.1002/rsa.3240050204zbMath0792.05123OpenAlexW2169846294MaRDI QIDQ4286296

Anne Condon, Diane Hernek

Publication date: 27 March 1994

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240050204

zbMATH Keywords

random walksstochastic matricesundirected graphscover timetime-inhomogeneous Markov chainsdominant eigenvectorscolored edges

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Toward a Theory of Markov Influence Systems and their Renormalization ⋮ Merging for inhomogeneous finite Markov chains. II: Nash and log-Sobolev inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Eigenvalues and expanders
• Non-negative matrices and Markov chains.
• Relationships between nondeterministic and deterministic tape complexities
• Proof of Shannon's Transmission Theorem for Finite-State Indecomposable Channels
• Finite state verifiers I
• Space-bounded probabilistic game automata
• Definite and Quasidefinite Sets of Stochastic Matrices
• Products of Indecomposable, Aperiodic, Stochastic Matrices

This page was built for publication: Random walks on colored graphs