Recurrence of random walk traces
classification
🧮 math.PR
keywords
edgesrandomwalkcrossedcrossingsfactformgraph
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.