Almost Sure Recurrence of the Simple Random Walk Path

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.

13 pages, updated version includes proof for unbounded degree graphs. Also see http://arxiv.org/abs/math/0603060 for another proof

Cited by in corpus (1)

• Recurrence of random walk traces