A semidefinite bound for mixing rates of Markov chainsOpen Website

1997 (modified: 06 Feb 2021)Random Struct. Algorithms 1997Readers: Everyone
Abstract: We study general geometric techniques for bounding the spectral gap of a reversible Markov chain. We show that the best bound obtainable using these techniques can be computed in polynomial time via ...
0 Replies

Loading