Type: Article
Publication Date: 2007-03-01
Citations: 19
DOI: https://doi.org/10.1214/009117906000000935
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.