Adaptive Test Allocation for Outbreak Detection and Tracking in Social Contact Networks

  title={Adaptive Test Allocation for Outbreak Detection and Tracking in Social Contact Networks},
  author={Pau Batlle and Joan Bruna and Carlos Fernandez-Granda and Victor M. Preciado},
  journal={SIAM J. Control. Optim.},
We present a general framework for adaptive allocation of viral tests in social contact networks. We pose and solve several complementary problems. First, we consider the design of a social sensing system whose objective is the early detection of a novel epidemic outbreak. In particular, we propose an algorithm to select a subset of individuals to be tested in order to detect the onset of an epidemic outbreak as fast as possible. We pose this problem as a hitting time probability maximization… 



Quantifying SARS-CoV-2 transmission suggests epidemic control with digital contact tracing

A mathematical model for infectiousness was developed to estimate the basic reproductive number R0 and to quantify the contribution of different transmission routes and the requirements for successful contact tracing, and the combination of two key parameters needed to reduce R0 to less than 1 was determined.

An analysis of the greedy algorithm for the submodular set covering problem

This work generalises earlier results of Dobson and others on the applications of the greedy algorithm to the integer covering problem: min, which includes the problem of finding a minimum weight basis in a matroid.

An analysis of approximations for maximizing submodular set functions—I

It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.

Conquering the Worst Case of Infections in Networks

These algorithms to control the scope of an infection spread on a network by allocating a fixed immunization budget to edges of the graph are developed and the computational feasibility of these algorithms and their efficacy at controlling epidemic spreads are illustrated.

Epidemic models on social networks—With inference

Stochastic models for the spread of an infection in a structured community, where this structured community is itself described by a random network model, are considered.

A General Framework for Sensor Placement in Source Localization

This analysis shows that, by using dynamic sensors, the number of sensors necessary to localize the source is reduced by up to a factor of 10 and that, even with high-variance transmission delays, the source can be localized by using fewer than fewer than $5\%$5% of the nodes as sensors.

Disease Surveillance on Complex Social Networks

This work evaluates three strategies for selecting sensors—sampling the most connected, random, and friends of random individuals—in three complex social networks—a simple scale-free network, an empirical Venezuelan college student network, and an empirical Montreal wireless hotspot usage network.

Mathematics of Epidemics on Networks: From Exact to Approximate Models

This textbook provides an exciting new addition to the area of network science featuring a stronger and more methodical link of models to their mathematical origin and explains how these relate to

Virus Spread in Networks

The influence of the network characteristics on the virus spread is analyzed in a new-the <i>N</i> -intertwined Markov chain-model, whose only approximation lies in the application of mean field

Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks

Various solved and open problems in the development, analysis, and control of epidemic models are reviewed and presented.