|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||A fast algorithm for calculating an expected outbreak size on dynamic contagion networks|
Kao, Rowland R
Contagion on networks
|Citation:||Enright J & Kao RR (2016) A fast algorithm for calculating an expected outbreak size on dynamic contagion networks, Epidemics, 16, pp. 56-62.|
|Abstract:||Calculation of expected outbreak size of a simple contagion on a known contact network is a common and important epidemiological task, and is typically carried out by computationally intensive simulation. We describe an efficient exact method to calculate the expected outbreak size of a contagion on an outbreak-invariant network that is a directed and acyclic, allowing us to model all dynamically changing networks when contagion can only travel forward in time. We describe our algorithm and its use in pseudocode, as well as showing examples of its use on disease relevant, data-derived networks.|
|Rights:||© 2016 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/)|
|Affiliation:||Mathematics - CSM Dept|
University of Glasgow
|Enright_and_Kao_Epidemics_2016.pdf||1.26 MB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.