University of Cambridge > > Optimization and Incentives Seminar > Viral Processes by Random Walks on Random Graphs

Viral Processes by Random Walks on Random Graphs

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

If you have a question about this talk, please contact Elena Yudovina.

We study the SIR epidemic model with infections carried by particles making independent random walks on a random regular graph. We demonstrate a reduction of the dynamics of the problem to an Erdos-Renyi random graph on the particle set P, which allows us to use standard results to determine phase transitions for the number of infected particles. Furthermore, edge weights on the E-R graph give information about when infections took place, which we exploit in the special SI case to determine a completion time for the process.

Joint work with Colin Cooper and Moez Draief accessible here

This talk is part of the Optimization and Incentives Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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