{
  "id": "math/0004164",
  "version": "v1",
  "published": "2000-04-26T12:58:58.000Z",
  "updated": "2000-04-26T12:58:58.000Z",
  "title": "No more than three favourite sites for simple random walk",
  "authors": [
    "Balint Toth"
  ],
  "comment": "20 pages",
  "categories": [
    "math.PR"
  ],
  "abstract": "We prove that, with probability one, eventually there are no more than three favourite (i.e. most visited) sites of simple random walk. This partially answers a relatively long standing question of Pal Erdos and Pal Revesz.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2000-04-26T12:58:58.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60J15",
      "60J55"
    ],
    "keywords": [
      "simple random walk",
      "favourite sites",
      "relatively long standing question",
      "pal erdos",
      "pal revesz"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 20,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2000math......4164T"
    }
  }
}