Geometric Bounds on the Fastest Mixing Markov Chain

Sam Olesker-Taylor, Luca Zanetti

In the Fastest Mixing Markov Chain problem, we are given a graph $G=(V,E)$ and desire the discrete-time Markov chain with smallest mixing time $\tau$ subject to having equilibrium…