Almost Sure Recurrence of the Simple Random Walk Path
classification
🧮 math.PR
math.MG
keywords
walkalmostpathrandomsimpleconsistingcrossededges
read the original abstract
It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.
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.