Annals of Probability

No more than three favorite sites for simple random walk

Bálint Tóth

Full-text: Open access

Abstract

We prove that, with probability 1, eventually there are no more than three favorite (i.e., most visited) sites of simple symmetric random walks. This partially answers a relatively longstanding question of Erdös and Révész.

Article information

Source
Ann. Probab., Volume 29, Number 1 (2001), 484-503.

Dates
First available in Project Euclid: 21 December 2001

Permanent link to this document
https://projecteuclid.org/euclid.aop/1008956341

Digital Object Identifier
doi:10.1214/aop/1008956341

Mathematical Reviews number (MathSciNet)
MR1825161

Zentralblatt MATH identifier
1031.60036

Subjects
Primary: 60J15 60J55: Local time and additive functionals

Keywords
Random walk local time favorite sites most visited sites

Citation

Tóth, Bálint. No more than three favorite sites for simple random walk. Ann. Probab. 29 (2001), no. 1, 484--503. doi:10.1214/aop/1008956341. https://projecteuclid.org/euclid.aop/1008956341


Export citation