| Almost Sure Recurrence of the Simple Random Walk Path (2005) | |||||||||
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.. Comment: 13 pages, updated version includes proof for unbounded degree graphs. Also see http://arxiv.org/abs/math/0603060 for another proof | |||||||||
Publication details | |||||||||
| |||||||||