The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Shuffling Cards and Stopping Times
The work
| Authors | David Aldous; Persi W. Diaconis |
|---|---|
| Editors | |
| Type | article |
| Year | 1986 |
| Citekey | aldous1986shuffling |
Where it appeared
| Published in | American Mathematical Monthly |
|---|---|
| Publisher | Taylor & Francis |
| Volume | 93 |
| Issue | 5 |
| Pages | 333 |
Identifiers
| DOI | 10.1080/00029890.1986.11971821 |
|---|---|
| OpenAlex | W2074599161 |
Access
| Landing page | https://doi.org/10.1080/00029890.1986.11971821 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
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
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-27 07:43 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@article{aldous1986shuffling,
title = {Shuffling Cards and Stopping Times},
author = {David Aldous and Persi W. Diaconis},
year = {1986},
journal = {American Mathematical Monthly},
publisher = {Taylor \& Francis},
volume = {93},
number = {5},
pages = {333},
doi = {10.1080/00029890.1986.11971821},
}
This record lives at https://refs.drheap.org/aldous1986shuffling/ and will keep doing so.