No more than three favorite sites for simple random walk

From MaRDI portal
Publication:1872196

DOI10.1214/AOP/1008956341zbMATH Open1031.60036arXivmath/0004164OpenAlexW2594437315MaRDI QIDQ1872196FDOQ1872196


Authors: Bálint Tóth Edit this on Wikidata


Publication date: 6 May 2003

Published in: The Annals of Probability (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0004164




Recommendations




Cites Work


Cited In (17)





This page was built for publication: No more than three favorite sites for simple random walk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872196)