Recurrent graphs where two independent random walks collide finitely often.
Krishnapur, Manjunath ; Peres, Yuval
Electronic Communications in Probability [electronic only], Tome 9 (2004), p. 72-81 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2004-01-01
EUDML-ID : urn:eudml:doc:124513 
@article{02145778,
     title = {Recurrent graphs where two independent random walks collide finitely often.},
     journal = {Electronic Communications in Probability [electronic only]},
     volume = {9},
     year = {2004},
     pages = {72-81},
     zbl = {1060.60044},
     language = {en},
     url = {http://dml.mathdoc.fr/item/02145778}
}

Krishnapur, Manjunath; Peres, Yuval. Recurrent graphs where two independent random walks collide finitely often.. Electronic Communications in Probability [electronic only], Tome 9 (2004) pp. 72-81. http://gdmltest.u-ga.fr/item/02145778/