Recurrence of random walk traces
Benjamini, Itai · Gurel-Gurevich, Ori · Lyons, Russell
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.