Abstract
We show that the edges crossed by a random walk in a network form a recurrent graph a.s. In fact, the same is true when those edges are weighted by the number of crossings.
Citation
Itai Benjamini. Ori Gurel-Gurevich. Russell Lyons. "Recurrence of random walk traces." Ann. Probab. 35 (2) 732 - 738, March 2007. https://doi.org/10.1214/009117906000000935
Information
