No more than three favourite sites for simple random walk
classification
🧮 math.PR
keywords
favouriterandomsimplesitesthreewalkanswerserdos
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.