No more than three favourite sites for simple random walk
Probability
2007-05-23 v1
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.
Cite
@article{arxiv.math/0004164,
title = {No more than three favourite sites for simple random walk},
author = {Balint Toth},
journal= {arXiv preprint arXiv:math/0004164},
year = {2007}
}
Comments
20 pages