Almost Sure Recurrence of the Simple Random Walk Path
概率论
2008-08-05 v2 度量几何
摘要
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.
引用
@article{arxiv.math/0508270,
title = {Almost Sure Recurrence of the Simple Random Walk Path},
author = {Itai Benjamini and Ori Gurel-Gurevich},
journal= {arXiv preprint arXiv:math/0508270},
year = {2008}
}
备注
13 pages, updated version includes proof for unbounded degree graphs. Also see http://arxiv.org/abs/math/0603060 for another proof