School of Technology and Computer Science Seminars

Collisions Between Random Walks

by Dr. Krishnapur Manjunath (Indian Institute of Science, Bangalore)

Monday, February 24, 2014 from to (Asia/Kolkata)
at Colaba Campus ( AG-80 )
Description
An infinite graph may have the property that two independent random walks on the graph  never meet each other, although each of them visits every vertex of the graph infinitely often. I shall describe some old results joint with Yuval Peres and later results of Barlow, Peres and Sousi. Finally I shall report some ongoing recent investigations in this direction.