Collisions Between Random Walks

Speaker: 

Manjunath Krishnapur

Affiliation: 

Indian Institute of Science
Department of Mathematics
Bangalore 560012

Time: 

Monday, 24 February 2014, 16:00 to 17:00

Venue: 

Organisers: 

Abstract: 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.