Recurrent graphs where two independent random walks collide finitely often.

Krishnapur, Manjunath, and Peres, Yuval. "Recurrent graphs where two independent random walks collide finitely often.." Electronic Communications in Probability [electronic only] 9 (2004): 72-81. <http://eudml.org/doc/124513>.

@article{Krishnapur2004,
author = {Krishnapur, Manjunath, Peres, Yuval},
journal = {Electronic Communications in Probability [electronic only]},
keywords = {comb lattice; collisions},
language = {eng},
pages = {72-81},
publisher = {University of Washington},
title = {Recurrent graphs where two independent random walks collide finitely often.},
url = {http://eudml.org/doc/124513},
volume = {9},
year = {2004},
}

TY - JOUR
AU - Krishnapur, Manjunath
AU - Peres, Yuval
TI - Recurrent graphs where two independent random walks collide finitely often.
JO - Electronic Communications in Probability [electronic only]
PY - 2004
PB - University of Washington
VL - 9
SP - 72
EP - 81
LA - eng
KW - comb lattice; collisions
UR - http://eudml.org/doc/124513
ER -