The DOI matches its Crossref record.
Shuffling Cards and Stopping Times
Abstract
1. Introduction. How many times must a deck of cards be shuffled until it is close to random? There is an elementary technique which often yields sharp estimates in such problems. The method is best understood through a simple example. EXAMPLE1. Top in at random shuffle. Consider the following method of mixing a deck of cards: the top card is removed and inserted into the deck at a random position. This procedure is
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
Cited by
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
Self-citationThe pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk
Madras, N., & Sokal, A. D. (1988) · Journal of Statistical Physics · doi:10.1007/bf01022990 · Cited by 939
Probability: Theory and Examples
Durrett, R. (2019) · doi:10.1017/9781108591034 · Cited by 857
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Fill, J. A. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005981 · Cited by 320
Metadata
- Authors
- Aldous, D., & Diaconis, P.
- Venue
- The American Mathematical Monthly
- Publisher
- Informa UK Limited
- Published
- 1986-05
- Volume
- 93
- Issue
- 5
- Pages
- 333-348
- ISSN
- 0002-9890 (ISSN-L)
- 1930-0972
- OpenAlex
- W2074599161
- Cited by
- 475
- References
- 0
- FWCI
- 9.84
- Type
- journal article
- Language
- en
- Open access
- closed
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: Shuffling Cards and Stopping Times. https://app.cochat.ai/papers/10.1080/00029890.1986.11971821
- The paper
- Aldous, D., & Diaconis, P. (1986). Shuffling Cards and Stopping Times. The American Mathematical Monthly. https://doi.org/10.1080/00029890.1986.11971821
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.
