University of Cambridge > > Trinity Mathematical Society > Multiple Random Walks

Multiple Random Walks

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity