Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 158

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Lifting Markov chains to speed up mixing

Open access
Chen, Fang, Lovász, László, Pak, Igor·1999·Proceedings of the thirty-first annual ACM symposium on Theory of Computing

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/301250.301315

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 158

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
1
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Lifting Markov chains to speed up mixing. https://app.cochat.ai/papers/10.1145/301250.301315
The paper
Chen, F., Lovász, L., & Pak, I. (1999). Lifting Markov chains to speed up mixing. Proceedings of the thirty-first annual ACM symposium on Theory of Computing. https://doi.org/10.1145/301250.301315

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.