{
  "id": "1402.5682",
  "version": "v1",
  "published": "2014-02-23T21:43:37.000Z",
  "updated": "2014-02-23T21:43:37.000Z",
  "title": "How Tall Can Be the Excursions of a Random Walk on a Spider",
  "authors": [
    "Antonia Foldes",
    "Pal Revesz"
  ],
  "comment": "14 pages",
  "categories": [
    "math.PR"
  ],
  "abstract": "We consider a simple symmetric random walk on a spider, that is a collection of half lines (we call them legs) joined at the origin. Our main question is the following: if the walker makes $n$ steps how high can he go up on all legs. This problem is discussed in two different situations; when the number of legs are increasing, as $n$ goes to infinity and when it is fixed.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-02-23T21:43:37.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60F05",
      "60F15",
      "60G50",
      "60J65",
      "60J10"
    ],
    "keywords": [
      "simple symmetric random walk",
      "excursions",
      "half lines",
      "main question",
      "collection"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1402.5682F"
    }
  }
}