Almost Sure Recurrence of the Simple Random Walk Path

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
13 pages, updated version includes proof for unbounded degree graphs. Also see http://arxiv.org/abs/math/0603060 for another proof

Keywords

Probability, Metric Geometry, 60G50

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/166271

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0508270
 http://arxiv.org/abs/math/0508270

Collections

arXiv