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. © Institute of Mathematical Statistics, 2007.
Cite
CITATION STYLE
APA
Benjamini, I., Gurel-Gurevich, O., & Lyons, R. (2007). Recurrence of random walk traces. Annals of Probability, 35(2), 732–738. https://doi.org/10.1214/009117906000000935
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free