FASTEST MIXING MARKOV CHAIN ON GRAPHS WITH SYMMETRIES
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 the second-largest eigenvalue modulus of the transition probability matrix). Exploiting symmetry can lead to significant...
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics,
2010-03-09T20:26:42Z.
|
Subjects: | |
Online Access: | Get fulltext |