Viral Processes by Random Walks on Random Graphs

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

• Mohammed Abdullah, KCL
• Monday 02 May 2011, 14:30-15:30
• MR5, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.

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 http://arxiv.org/abs/1104.3789

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

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Economics and Computer Science Talks
• Hanchen DaDaDash
• Interested Talks
• MR5, Centre for Mathematical Sciences, Wilberforce Road, Cambridge
• Optimization and Incentives Seminar
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.