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.
Original language | English |
---|---|
Pages (from-to) | 732-738 |
Number of pages | 7 |
Journal | Annals of Probability |
Volume | 35 |
Issue number | 2 |
DOIs | |
State | Published - 2007 |
Externally published | Yes |
Keywords
- Graphs
- Networks
- Paths