Recurrent graphs where two independent random walks collide finitely often

Manjunath Krishnapur, Yuval Peres

We 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, obtain…