University of Cambridge > Talks.cam > Trinity Mathematical Society > Multiple Random Walks

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Multiple Random Walks

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Tilley Lecture Theater, Department of Earth Sciences (can join via zoom; email bb614@cam.ac.uk for link) online via MS Teams Military History Working Group (Centre for Geopolitics)

Other talks

TBC Title to be confirmed Precision psychiatry Cultural evolution creates language-like structure: from humans to humpback whales and beyond Caribbean Trip and Cacti Market Failure, Organ Shortage, Pandemic and Climate Change: The Architecture of Cooperation
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity