No more than three favourite sites for simple random walk

Simple item page
dc.creatorToth, Balint
dc.date2000-04-26
dc.date.accessioned2026-07-07T04:34:53Z
dc.date.available2026-07-07T04:34:53Z
dc.descriptionWe 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.
dc.description20 pages
dc.identifierhttps://arxiv.org/abs/math/0004164
dc.identifierhttp://arxiv.org/abs/math/0004164
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59076
dc.subjectProbability
dc.subject60J15, 60J55
dc.titleNo more than three favourite sites for simple random walk
dc.typetext

Files

Collections

arXiv