![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Monday 02 May 2011, 14:30-15:30
Viral Processes by Random Walks on Random Graphs
- 👤 Speaker: Mohammed Abdullah, KCL
- 📅 Date & Time: Monday 02 May 2011, 14:30 - 15:30
- 📍 Venue: MR5, Centre for Mathematical Sciences, Wilberforce Road, Cambridge
Abstract
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
Series This talk is part of the Optimization and Incentives Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- CMS Events
- DPMMS info aggregator
- DPMMS lists
- 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
- yk449
Note: Ex-directory lists are not shown.