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.
Publié le : 2007-03-14
Classification:
Paths,
networks,
graphs,
60J05,
60D05
@article{1175287760,
author = {Benjamini, Itai and Gurel-Gurevich, Ori and Lyons, Russell},
title = {Recurrence of random walk traces},
journal = {Ann. Probab.},
volume = {35},
number = {1},
year = {2007},
pages = { 732-738},
language = {en},
url = {http://dml.mathdoc.fr/item/1175287760}
}
Benjamini, Itai; Gurel-Gurevich, Ori; Lyons, Russell. Recurrence of random walk traces. Ann. Probab., Tome 35 (2007) no. 1, pp. 732-738. http://gdmltest.u-ga.fr/item/1175287760/