Recurrent graphs where two independent random walks collide finitely often

Simple item page
dc.creatorKrishnapur, Manjunath
dc.creatorPeres, Yuval
dc.date2004-06-23
dc.date2004-08-02
dc.date.accessioned2026-07-07T05:09:32Z
dc.date.available2026-07-07T05:09:32Z
dc.descriptionWe present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z^2 by removing all horizontal edges off the X-axis, has this property. We also conjecture that the same property holds for some other graphs, including the incipient infinite cluster for critical percolation in Z^2.
dc.description10 pages, 1 figure; Minor changes made
dc.identifierhttps://arxiv.org/abs/math/0406487
dc.identifierhttp://arxiv.org/abs/math/0406487
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71659
dc.subjectProbability
dc.titleRecurrent graphs where two independent random walks collide finitely often
dc.typetext

Files

Collections

arXiv