Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Distributed Algorithm for Suppressing Epidemic Spread in Networks

Published

Author(s)

Van Sy Mai, Abdella Battou, Kevin L. Mills

Abstract

This paper considers problems related to suppressing epidemic spread over networks given limited curing resources. The spreading dynamic is captured by a susceptible-infected- susceptible model. The epidemic threshold and recovery speed are determined by the contact network structure and the heterogeneous infection and curing rates. We develop a distributed algorithm that can be used for allocating curing resources to meet three potential objectives: minimize total curing cost while preventing an epidemic; maximize recovery speed given sufficient curing resources; or given insufficient curing resources, limit the size of an endemic state. The distributed algorithm is of the Jacobi type, and converges geometrically. We prove an upper bound on the convergence rate; the bound depends on the structure and infection rates of the underlying network. Numerical simulations illustrate the efficiency and scalability of our distributed algorithm.
Citation
IEEE Control Systems Letters
Volume
2
Issue
3

Keywords

distributed optimization, epidemic spreading, complex networks, networked control systems

Citation

, V. , Battou, A. and Mills, K. (2018), Distributed Algorithm for Suppressing Epidemic Spread in Networks, IEEE Control Systems Letters, [online], https://doi.org/10.1109/LCSYS.2018.2844118 (Accessed October 31, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created June 4, 2018, Updated January 27, 2020