Almost Sure Recurrence of the Simple Random Walk Path

Authors Itai Benjamini, Ori Gurel-Gurevich

Publication date 15 August 2005

Sums of independent random variables; random walks (60G50)

Abstract: It 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.

This page was built for publication: Almost Sure Recurrence of the Simple Random Walk Path

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