Multiple Random Walks

Add to your list(s) Download to your calendar using vCal

• Dr Thomas Sauerwald (Computer Lab)
• Monday 13 February 2017, 20:30-21:30
• Winstanley Lecture Theatre, Trinity College.

If you have a question about this talk, please contact Michelle Sweering.

Consider a simple random walk on a finite network. The expected time it takes for a single walk to visit all nodes is a well-studied quantity and has been computed for many topologies including paths, grids, random graphs and hypercubes. But how long does it take for two or more independently running random walks? This talk will explain why this may be an interesting question and present a few surprising results.

This talk is part of the Trinity Mathematical Society series.

This talk is included in these lists:

• Guy Emerson's list
• Trinity Mathematical Society
• Winstanley Lecture Theatre, Trinity College
• bld31

Note that ex-directory lists are not shown.