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: | Xiao, Lin (Author), Diaconis, Persi (Author), Boyd, Stephen P. (Author), Parrilo, Pablo A. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics,
2010-03-09T20:26:42Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
The mixing times for the Markov chain on graphs
by: Yu-Huang Chen, et al.
Published: (2015) -
Applications of Rapidly Mixing Markov Chains to Problems in Graph Theory
by: Simmons, Dayton C. (Dayton Cooper)
Published: (1993) -
The Fastest Way to the Cecum
by: Christopher B Williams
Published: (1993-01-01) -
Catching the Fastest Boomerangs
by: Stéphanie Delaune, et al.
Published: (2020-12-01) -
Catching the Fastest Boomerangs
by: Stéphanie Delaune, et al.
Published: (2020-12-01)