Almost Sure Recurrence of the Simple Random Walk Path

Simple item page
dc.creatorBenjamini, Itai
dc.creatorGurel-Gurevich, Ori
dc.date2005-08-15
dc.date2008-08-04
dc.date.accessioned2026-07-07T09:54:19Z
dc.date.available2026-07-07T09:54:19Z
dc.descriptionIt is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.
dc.description13 pages, updated version includes proof for unbounded degree graphs. Also see http://arxiv.org/abs/math/0603060 for another proof
dc.identifierhttps://arxiv.org/abs/math/0508270
dc.identifierhttp://arxiv.org/abs/math/0508270
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166271
dc.subjectProbability
dc.subjectMetric Geometry
dc.subject60G50
dc.titleAlmost Sure Recurrence of the Simple Random Walk Path
dc.typetext

Files

Collections

arXiv