8 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
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 τ subject to having equilibrium…