Intersection Conductance and Canonical Alternating Paths: Methods for General Finite Markov Chains

DOI10.1017/S096354831400025XzbMath1315.60085arXivmath/0611585OpenAlexW2949430827MaRDI QIDQ5495677

Ravi Montenegro

Publication date: 6 August 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphconductancecanonical paths methodevolving sets methodgeneral finite Markov chainsmax-degree walknon-reversible non-lazy walk

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Strong stationary times via a new form of duality
• Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
• Geometric bounds for eigenvalues of Markov chains
• Markov chain comparison
• Comparison theorems for reversible Markov chains
• Evolving sets, mixing and heat kernel bounds
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• Blocking Conductance and Mixing in Random Walks

This page was built for publication: Intersection Conductance and Canonical Alternating Paths: Methods for General Finite Markov Chains