Year: 2007
Type: article
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.
Source: The Annals of Probability
Authors: Itai Benjamini, Ori Gurel-Gurevich, Russell Lyons
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W1995444001