BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Multiple Random Walks - Dr Thomas Sauerwald (Computer Lab)
DTSTART:20170213T203000Z
DTEND:20170213T213000Z
UID:TALK71041@talks.cam.ac.uk
CONTACT:Michelle Sweering
DESCRIPTION:Consider a simple random walk on a finite network. The expecte
 d time it takes for a single walk to visit all nodes is a well-studied qua
 ntity and has been computed for many topologies including paths\, grids\, 
 random graphs and hypercubes. But how long does it take for two or more in
 dependently running random walks? This talk will explain why this may be a
 n interesting question and present a few surprising results.
LOCATION:Winstanley Lecture Theatre\, Trinity College
END:VEVENT
END:VCALENDAR