Fastest mixing Markov chain problem for the union of two cliques

DOI10.1080/03081087.2010.538690zbMath1222.05144OpenAlexW2074400367MaRDI QIDQ3090727

Mary Allison, Bryan L. Shader

Publication date: 1 September 2011

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2010.538690

zbMATH Keywords

Markov chainrandom walkfastest mixingsubdominant eigenvaluessecond largest eigenvalue modulus

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Random walks on graphs (05C81)

Related Items (2)

Geometric bounds on the fastest mixing Markov chain ⋮ Remarks and open problems on the minimum permanent of acyclic doubly stochastic matrices

Cites Work

• Unnamed Item
• Geometric bounds for eigenvalues of Markov chains
• Fastest Mixing Markov Chain on a Graph
• Fastest Mixing Markov Chain on a Path
• Symmetry Analysis of Reversible Markov Chains

This page was built for publication: Fastest mixing Markov chain problem for the union of two cliques