Recurrence of random walk traces
概率论
2009-09-29 v3
摘要
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.
引用
@article{arxiv.math/0603060,
title = {Recurrence of random walk traces},
author = {Itai Benjamini and Ori Gurel-Gurevich and Russell Lyons},
journal= {arXiv preprint arXiv:math/0603060},
year = {2009}
}
备注
Published at http://dx.doi.org/10.1214/009117906000000935 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)