Lifting Markov chains to speed up mixing

There are several examples where the mixing time of a Markov chain can be reduced substantially, often to about its square root, by “lifting”, i.e., by splitting each state into several states. In several examples of random walks on groups, the lifted chain not only mixes better, but is easier to analyze. We characterize the best mixing time achievable through lifting in terms of multicommodity flows. We show that the reduction to square root is best possible. If the lifted chain is time-reversible, then the gain is smaller, at most a factor of log(l/na), where 110 is the smallest stationary probability of any state. We give an example showing that a gain of a factor of log(l/~o)/log log(l/rro) is possible.

[1]  Richard Stong,et al.  Random Walks on the Groups of Upper Triangular Matrices , 1995 .

[2]  Peter Winkler,et al.  Efficient stopping rules for Markov chains , 1995, STOC '95.

[3]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[4]  P. H. Roberts,et al.  On random rotations , 1984, Advances in Applied Probability.

[5]  Peter Winkler,et al.  Mixing times , 1997, Microsurveys in Discrete Probability.

[6]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[7]  Peter Winkler.  Eecient Stopping Rules for Markov Chains , 2007 .

[8]  D. Aldous.  Some Inequalities for Reversible Markov Chains , 1982 .

[9]  . Markov Chains and Random Walks on Graphs , .

[10]  Yuval Roichman,et al.  Upper bound on the characters of the symmetric groups , 1996 .

[11]  Uzi Vishne,et al.  Mixing and Covering in the Symmetric Groups , 1998 .

[12]  Mark Jerrum,et al.  Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved , 1988, STOC '88.

[13]  Igor Pak,et al.  Two Random Walks on Upper Triangular Matrices , 2000 .

[14]  Peter Winkler,et al.  Reversal of Markov Chains and the Forget Time , 1998, Comb. Probab. Comput..

[15]  Radford M. Neal,et al.  ANALYSIS OF A NONREVERSIBLE MARKOV CHAIN SAMPLER , 2000 .

[16]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.