Open Access
February 2001 No more than three favorite sites for simple random walk
Bálint Tóth
Ann. Probab. 29(1): 484-503 (February 2001). DOI: 10.1214/aop/1008956341


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.


Download Citation

Bálint Tóth. "No more than three favorite sites for simple random walk." Ann. Probab. 29 (1) 484 - 503, February 2001.


Published: February 2001
First available in Project Euclid: 21 December 2001

zbMATH: 1031.60036
MathSciNet: MR1825161
Digital Object Identifier: 10.1214/aop/1008956341

Primary: 60J15 , 60J55

Keywords: favorite sites , Local time , most visited sites , Random walk

Rights: Copyright © 2001 Institute of Mathematical Statistics

Vol.29 • No. 1 • February 2001
Back to Top