Optimal Vaccine Allocation to Control Epidemic Outbreaks in Arbitrary Networks

Abstract

We consider the problem of controlling the propagation of an epidemic outbreak in an arbitrary contact network by distributing vaccination resources throughout the network. We analyze a networked version of the Susceptible-Infected-Susceptible (SIS) epidemic model when individuals in the network present different levels of susceptibility to the epidemic. In this context, controlling the spread of an epidemic outbreak can be written as a spectral condition involving the eigenvalues of a matrix that depends on the network structure and the parameters of the model. We study the problem of finding the optimal distribution of vaccines throughout the network to control the spread of an epidemic outbreak. We propose a convex framework to find cost-optimal distribution of vaccination resources when different levels of vaccination are allowed. We also propose a greedy approach with quality guarantees for the case of all-or-nothing vaccination. We illustrate our approaches with numerical simulations in a real social network.

References in corpus (2)

• The Dynamics of Viral Marketing
• Structural Analysis of Viral Spreading Processes in Social and Communication Networks Using Egonets

Cited by in corpus (11)

• Analysis and Control of Epidemics: A survey of spreading processes on complex networks
• Input graph: the hidden geometry in controlling complex networks
• Data-Driven Control of the COVID-19 Outbreak via Non-Pharmaceutical Interventions: A Geometric Programming Approach
• A lower bound on the performance of dynamic curing policies for epidemics on graphs
• Optimal Control of Complex Systems through Variational Inference with a Discrete Event Decision Process
• SIS Epidemic Spreading with Heterogeneous Infection Rates
• Traffic Control for Network Protection Against Spreading Processes
• An efficient curing policy for epidemics on graphs
• Heterogeneous Recovery Rates against SIS Epidemics in Directed Networks
• The Stochastic Firefighter Problem
• Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication