{
  "id": "1307.2887",
  "version": "v1",
  "published": "2013-07-10T19:31:45.000Z",
  "updated": "2013-07-10T19:31:45.000Z",
  "title": "Total variation cutoff in a tree",
  "authors": [
    "Yuval Peres",
    "Perla Sousi"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "We construct a family of trees on which a lazy simple random walk exhibits total variation cutoff. The main idea behind the construction is that hitting times of large sets should be concentrated around their means. For this sequence of trees we compute the mixing time, the relaxation time and the cutoff window.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-07-10T19:31:45.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60J10"
    ],
    "keywords": [
      "total variation cutoff",
      "lazy simple random walk",
      "cutoff window",
      "main idea",
      "large sets"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1307.2887P"
    }
  }
}