We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Surveillance versus contact-tracing on configuration model graphs

Formal Metadata

Title
Surveillance versus contact-tracing on configuration model graphs
Title of Series
Number of Parts
19
Author
License
CC Attribution - NonCommercial - NoDerivatives 4.0 International:
You are free to use, copy, distribute and transmit the work or content in unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
The main object of study in this paper is an epidemic process on a large network in the presence of various public health interventions. As an example, we consider a simple Susceptible-Infected (SI)-type epidemic process on a Configuration Model (CM) random graph with public health interventions in the form of active random surveillance and contact-tracing. While infected individuals attempt to infect their neighbours, they themselves are at risk of removal due to random surveillance and contact-tracing. We allow the random graph to be constructed dynamically as an outcome of the spread of infection and removal due to contact-tracing. We study the large graph limit of these two competing processes (infection and contact-tracing) as the number of vertices grows to infinity. From the public health perspective, the large graph limit can be utilized to determine the optimal rates for surveillance and contact-tracing given a fixed budget constraint by formulating a suitable optimal control problem. Joint work with Soheil Eshghi, Eben Kenah, Forrest W. Crawford and Grzegorz A. Rempała.