Lifting Markov chains to speed up mixing
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Random walks on finite groups and rapidly mixing markov chains
Aldous, D. (1983) · Lecture notes in mathematics · doi:10.1007/bfb0068322 · Cited by 583
Leighton, T., & Rao, S. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21958 · Cited by 395 · cited 2×
“For time-reversible chains, it is easy to derive from a well-known theorem of Leighton and Rao [7] the following reverse bound: 2.4 Conductance”
BackgroundInfluentialAnalysis of a nonreversible Markov chain sampler
Diaconis, P., Holmes, S., & Neal, R. M. (2000) · The Annals of Applied Probability · doi:10.1214/aoap/1019487508 · Cited by 284
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
Jerrum, M., & Sinclair, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62234 · Cited by 201
Some Inequalities for Reversible Markov Chains
Aldous, D. (1982) · Journal of the London Mathematical Society · doi:10.1112/jlms/s2-25.3.564 · Cited by 124
Upper bound on the characters of the symmetric groups
Roichman, Y. (1996) · Inventiones mathematicae · doi:10.1007/s002220050083 · Cited by 79 · cited 1×
“The upper bound is also O(logn) (see [13] ).”
BackgroundRandom Walks on the Groups of Upper Triangular Matrices
Stong, R. (1995) · The Annals of Probability · doi:10.1214/aop/1176987809 · Cited by 21
Mixing and Covering in the Symmetric Groups
Vishne, U. (1998) · Journal of Algebra · doi:10.1006/jabr.1997.7366 · Cited by 15 · cited 1×
“On the other hand, diameter of the Cayley graph is O(1) (see [15]).”
Background
Cited by
Gossip Algorithms for Distributed Signal Processing
Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M. G., & Scaglione, A. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2052531 · Cited by 741
Gossip Algorithms for Distributed Signal Processing
Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M., & Scaglione, A. (2018) · doi:10.1184/r1/6468842.v1 · Cited by 692
Aharonov, D., Ambainis, A., Kempe, J., & Vazirani, U. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380758 · Cited by 654
“scovery. We list here a few selected open problems. The first open question is for which graphs quantum speed up is achievable. More generally, can the 1/Φ lower bound always be achieved quantumly? In [3] it was shown that for any Markov chain, there exists a lifted version of it which achieves this bound, but no lifti…”
BackgroundMoore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Estimating and sampling graphs with multidimensional random walks
Ribeiro, B., & Towsley, D. (2010) · Proceedings of the 10th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1879141.1879192 · Cited by 341
Markov Chain Monte Carlo Methods for Bayesian Data Analysis in Astronomy
Sharma, S. (2017) · Annual Review of Astronomy and Astrophysics · doi:10.1146/annurev-astro-082214-122339 · Cited by 298
Expander flows, geometric embeddings and graph partitioning
Arora, S., Rao, S., & Vazirani, U. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007355 · Cited by 297
Analysis of a nonreversible Markov chain sampler
Diaconis, P., Holmes, S., & Neal, R. M. (2000) · The Annals of Applied Probability · doi:10.1214/aoap/1019487508 · Cited by 284
Non-Reversible Parallel Tempering: A Scalable Highly Parallel MCMC Scheme
Syed, S., Bouchard-Côté, A., Deligiannidis, G., & Doucet, A. (2022) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12464 · Cited by 68
Metadata
- Authors
- Chen, F., Lovász, L., & Pak, I.
- Venue
- Proceedings of the thirty-first annual ACM symposium on Theory of Computing
- Publisher
- ACM
- Published
- 1999-05
- Pages
- 275-281
- OpenAlex
- W1985215886
- Cited by
- 158
- References
- 9
- FWCI
- 6.71
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.