Recurrence of random walk traces

Itai Benjamini*, Ori Gurel-Gurevich, Russell Lyons

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

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 languageAmerican English
Pages (from-to)732-738
Number of pages7
JournalAnnals of Probability
Volume35
Issue number2
DOIs
StatePublished - 2007
Externally publishedYes

Keywords

  • Graphs
  • Networks
  • Paths

Fingerprint

Dive into the research topics of 'Recurrence of random walk traces'. Together they form a unique fingerprint.

Cite this