No more than three favourite sites for simple random walk
Abstract
Description
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.
20 pages
20 pages