arXiv Analytics

Sign in

arXiv:math/0004164 [math.PR]AbstractReferencesReviewsResources

No more than three favourite sites for simple random walk

Balint Toth

Published 2000-04-26Version 1

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.

Comments: 20 pages
Categories: math.PR
Subjects: 60J15, 60J55
Related articles: Most relevant | Search more
arXiv:math/0006173 [math.PR] (Published 2000-06-22)
Favourite sites of simple random walk
arXiv:math/0303321 [math.PR] (Published 2003-03-26, updated 2005-04-06)
Anchored expansion, percolation and speed
arXiv:0902.4369 [math.PR] (Published 2009-02-25)
Strong limit theorems for a simple random walk on the 2-dimensional comb

Links

Toolbox