The simple random walk and max-degree walk on a directed graph

DOI10.1002/RSA.20227zbMath1225.05222arXivmath/0609303OpenAlexW2952154243MaRDI QIDQ3633018

Ravi Montenegro

Publication date: 16 June 2009

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

Full work available at URL: https://arxiv.org/abs/math/0609303

zbMATH Keywords

eigenvaluesMarkov chainspectral gapEulerian graphevolving sets

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)

Cites Work

• Sharp edge, vertex, and mixed Cheeger inequalities for finite Markov kernels
• Blocking Conductance and Mixing in Random Walks

This page was built for publication: The simple random walk and max-degree walk on a directed graph