Lifting Markov chains to speed up mixing
Authors:
Open Access
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 275-281
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Mixing and Covering in the Symmetric GroupsJournal of Algebra, 1998
- Upper bound on the characters of the symmetric groupsInventiones Mathematicae, 1996
- Random Walks on the Groups of Upper Triangular MatricesThe Annals of Probability, 1995
- Efficient stopping rules for Markov chains1995
- Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved1988
- Group representations in probability and statistics1988
- An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms1988
- Random walks on finite groups and rapidly mixing markov chains1983