# Recurrent graphs where two independent random walks collide finitely often.

Krishnapur, Manjunath; Peres, Yuval

Electronic Communications in Probability [electronic only] (2004)

- Volume: 9, page 72-81
- ISSN: 1083-589X

## Access Full Article

top## How to cite

topKrishnapur, 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 -

## Citations in EuDML Documents

top## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.