Optimal curing resource allocation for epidemic spreading processes?

被引:8
|
作者
Jafarizadeh, Saber [1 ]
Veitch, Darryl [2 ]
机构
[1] Rakuten Inc, Tokyo 1580094, Japan
[2] Univ Technol Sydney, Sch Elect & Data Engn, Sydney, NSW 2007, Australia
关键词
Susceptible-Infected-Susceptible model; Epidemic spreading processes; Semidefinite programming; NETWORK; DIFFUSION; MODELS; POLICY;
D O I
10.1016/j.automatica.2023.110851
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The networked Susceptible-Infected-Susceptible (SIS) model is one of the well-developed models for epidemic spreading processes in networked systems. For a network that has an unstable healthy state, and follows the networked SIS model, a problem of interest is to stabilize the healthy state by increasing the curing rates of individuals, while minimizing the total cost associated with the additional curing rates over the network. Here this minimum control budget problem is reformulated as a standard semidefinite programming problem and an iterative algorithm is developed for determining the optimal additional curing rates for each agent in the network. We address arbitrary undirected topologies, with both symmetric and asymmetric infection rates. For a number of topologies, solutions have been provided for the case of uniform curing and infection rates for all possible ranges of the effective infection rate. Moreover, we have investigated the case of discrete-time SIS models and have shown that the algorithm developed based on the continuous-time model can be extended to this case. Based on the daily COVID-19 infections over the USA, the curing and infection rates have been estimated for a simulation scenario. Using these simulations, the algorithm is shown to have lower complexity than the well-known SDPT3 tool, and to have orders of magnitude lower computational and memory requirements.
引用
收藏
页数:8
相关论文
共 50 条
  • [11] Optimal curing policy for epidemic spreading over a community network with heterogeneous population
    Ottaviano, Stefania
    De Pellegrini, Francesco
    Bonaccorsi, Stefano
    Van Mieghem, Piet
    JOURNAL OF COMPLEX NETWORKS, 2018, 6 (05) : 800 - 829
  • [12] A Genetic Algorithm for Finding an Optimal Curing Strategy for Epidemic Spreading in Weighted Networks
    Pizzuti, Clara
    Socievole, Annalisa
    GECCO'18: PROCEEDINGS OF THE 2018 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2018, : 498 - 504
  • [13] ON OPTIMAL RESOURCE ALLOCATION IN MULTISTAGE FEEDBACK PROCESSES
    RUDD, DF
    JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (03): : 448 - 453
  • [14] OPTIMAL RESOURCE-ALLOCATION FOR 2 PROCESSES
    COURCOUBETIS, C
    VARAIYA, P
    AT&T TECHNICAL JOURNAL, 1985, 64 (01): : 1 - 14
  • [15] OPTIMAL RESOURCE ALLOCATION FOR TWO PROCESSES.
    Courcoubetis, Costas
    Varaiya, P.
    AT&T Technical Journal, 1985, 64 (1 pt 1): : 1 - 14
  • [16] Optimal Resource Allocation for Fast Epidemic Monitoring in Networked Populations
    Di Giamberardino, Paolo
    Iacoviello, Daniela
    Papa, Federico
    PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS (ICINCO), 2022, : 616 - 625
  • [17] Optimal Resource Allocation to Reduce an Epidemic Spread and Its Complication
    Di Giamberardino, Paolo
    Iacoviello, Daniela
    INFORMATION, 2019, 10 (06):
  • [18] Self-Awareness-Based Resource Allocation Strategy for Containment of Epidemic Spreading
    Chen, Xiaolong
    Liu, Quanhui
    Wang, Ruijie
    Li, Qing
    Wang, Wei
    COMPLEXITY, 2020, 2020
  • [19] Optimal Allocation Sequences of Two Processes Sharing a Resource
    Bruno Gaujal
    Discrete Event Dynamic Systems, 1997, 7 : 327 - 354
  • [20] Optimal allocation sequences of two processes sharing a resource
    Gaujal, B
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 1997, 7 (04): : 327 - 354