Fastest mixing Markov chain on graphs with symmetries

Stephen Boyd, Persi Diaconis, Pablo A. Parrilo +1

We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize t…