No more than three favorite sites for simple random walk

• 成果类型: Article
• 署名作者: Tóth, B
• 署名单位: Budapest University of Technology & Economics
• 刊物名称: ANNALS OF PROBABILITY
• ISSN/ISSBN: 0091-1798
• DOI: 10.1214/aop/1008956341
• 发表日期: 2001
• 页码: 484-503
• 关键词: limit-theorems; visited sites

摘要

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 Erdos and Revesz.