English

How Tall Can Be the Excursions of a Random Walk on a Spider

Probability 2014-02-25 v1

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 nn 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 nn goes to infinity and when it is fixed.

Keywords

Cite

@article{arxiv.1402.5682,
  title  = {How Tall Can Be the Excursions of a Random Walk on a Spider},
  author = {Antonia Foldes and Pal Revesz},
  journal= {arXiv preprint arXiv:1402.5682},
  year   = {2014}
}

Comments

14 pages