Almost Sure Recurrence of the Simple Random Walk Path
Itai Benjamini, Ori Gurel-Gurevich
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.
Create a lesson
Related papers
Approximate independence of typical marginals of high-dimensional probability measures
Manuel Arnese, Daniel Lacker
Weak uniqueness for the stochastic heat equation with nondegenerate diffusion: the full Hölder regime
Yi Han
A second eigenvalue lower bound for the directed configuration model
Charles Bordenave, Yizhe Zhu
Necessary and sufficient conditions for the martingale property of stochastic exponentials driven by multi-dimensional diffusions
Erhan Bayraktar, Hao Xing
Validity of the Behrens--Fisher solution
Gunnar Taraldsen
Sublinear multi-type preferential attachment
Anna Ben-Hamou, Nicolas Broutin, Camille Cazaux