The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Strong uniform times and finite random walks
Open accessAbstract
There are several techniques for obtaining bounds on the rate of convergence to the stationary distribution for Markov chains with strong symmetry properties, in particular random walks on finite groups. An elementary method, strong uniform times, is often effective. We prove such times always exist, and relate this method to coupling and Fourier analysis.
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.
Integrity signals
Registry
Cites
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.
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
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
Cited by
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Self-citationOn Choosing and Bounding Probability Metrics
Gibbs, A. L., & Su, F. E. (2002) · International Statistical Review · doi:10.1111/j.1751-5823.2002.tb00178.x · Cited by 1,163
General state space Markov chains and MCMC algorithms
Roberts, G. O., & Rosenthal, J. S. (2004) · Probability Surveys · doi:10.1214/154957804100000024 · Cited by 734
Lectures on finite Markov chains
Saloff-Coste, L. (1997) · Lecture Notes in Mathematics · doi:10.1007/bfb0092621 · Cited by 382
Strong Stationary Times Via a New Form of Duality
Diaconis, P., & Fill, J. A. (1990) · The Annals of Probability · doi:10.1214/aop/1176990628 · Cited by 253
Self-citation
Metadata
- Authors
- Aldous, D., & Diaconis, P.
- Venue
- Advances in Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 1987-03
- Volume
- 8
- Issue
- 1
- Pages
- 69-97
- ISSN
- 0196-8858 (ISSN-L)
- OpenAlex
- W2086490380
- Cited by
- 233
- References
- 1
- FWCI
- 4.73
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Strong uniform times and finite random walks. https://app.cochat.ai/papers/10.1016/0196-8858(87)90006-6
- The paper
- Aldous, D., & Diaconis, P. (1987). Strong uniform times and finite random walks. Advances in Applied Mathematics. https://doi.org/10.1016/0196-8858(87)90006-6
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.
