{
  "id": "math/0507307",
  "version": "v1",
  "published": "2005-07-15T06:20:44.000Z",
  "updated": "2005-07-15T06:20:44.000Z",
  "title": "The mixing time of the Thorp shuffle",
  "authors": [
    "Ben Morris"
  ],
  "comment": "21 pages",
  "categories": [
    "math.PR"
  ],
  "abstract": "The Thorp shuffle is defined as follows. Cut the deck into two equal piles. Drop the first card from the left pile or the right pile according to the outcome of a fair coin flip; then drop from the other pile. Continue this way until both piles are empty. We show that the mixing time for the Thorp shuffle with $2^d$ cards is polynomial in $d$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2005-07-15T06:20:44.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60J10"
    ],
    "keywords": [
      "thorp shuffle",
      "mixing time",
      "fair coin flip",
      "equal piles",
      "first card"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 21,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2005math......7307M"
    }
  }
}