Optimal Resource Allocation for Network Protection Against Spreading Processes
From MaRDI portal
Publication:5358409
Abstract: We study the problem of containing spreading processes in arbitrary directed networks by distributing protection resources throughout the nodes of the network. We consider two types of protection resources are available: (i) Preventive resources able to defend nodes against the spreading (such as vaccines in a viral infection process), and (ii) corrective resources able to neutralize the spreading after it has reached a node (such as antidotes). We assume that both preventive and corrective resources have an associated cost and study the problem of finding the cost-optimal distribution of resources throughout the nodes of the network. We analyze these questions in the context of viral spreading processes in directed networks. We study the following two problems: (i) Given a fixed budget, find the optimal allocation of preventive and corrective resources in the network to achieve the highest level of containment, and (ii) when a budget is not specified, find the minimum budget required to control the spreading process. We show that both resource allocation problems can be solved in polynomial time using Geometric Programming (GP) for arbitrary directed graphs of nonidentical nodes and a wide class of cost functions. Furthermore, our approach allows to optimize simultaneously over both preventive and corrective resources, even in the case of cost functions being node-dependent. We illustrate our approach by designing optimal protection strategies to contain an epidemic outbreak that propagates through an air transportation network.
Recommendations
- Optimal Resource Allocation for Control of Networked Epidemic Models
- Optimal Resource Allocation for Competitive Spreading Processes on Bilayer Networks
- Optimal resource diffusion for suppressing disease spreading in multiplex networks
- Optimal resource distribution between protection and redundancy considering the time and uncertainties of attacks
- scientific article; zbMATH DE number 7042423
- Sparse Resource Allocation for Linear Network Spread Dynamics
Cited in
(45)- Effects of concurrency on epidemic spreading in Markovian temporal networks
- Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms
- The dynamics of epidemic spreading on signed networks
- Individual-based optimal weight adaptation for heterogeneous epidemic spreading networks
- Stability of epidemic models over directed graphs: A positive systems approach
- Defending against online social network rumors through optimal control approach
- Metzler/zeta correspondence
- Heterogeneous virus propagation in networks: a theoretical study
- Data-driven fair resource allocation for novel emerging epidemics: a COVID-19 Convalescent Plasma case study
- Sublinear circuits and the constrained signomial nonnegativity problem
- Incentive rate determination in viral marketing
- Distributed discrete-time optimization algorithms with applications to resource allocation in epidemics control
- Allocating resources for epidemic spreading on metapopulation networks
- Optimal curing rate allocation in the SIS epidemic model
- Estimating the epidemic threshold on networks by deterministic connections
- Testing alone is insufficient
- Centrality-Based Traffic Restriction in Delayed Epidemic Networks
- The optimal dynamic immunization under a controlled heterogeneous node-based SIRS model
- Dynamic malware containment under an epidemic model with alert
- SIS epidemic spreading with correlated heterogeneous infection rates
- The optimal edge for containing the spreading of SIS model
- On the optimal dynamic control strategy of disruptive computer virus
- Self-awareness-based resource allocation strategy for containment of epidemic spreading
- Epidemic population games and evolutionary dynamics
- Second-order moment-closure for tighter epidemic thresholds
- Competitive pricing under local network effects
- Edge deletion algorithms for minimizing spread in SIR epidemic models
- Epidemic Spreading Curing Strategy Over Directed Networks
- Parameter estimation in epidemic spread networks using limited measurements
- Epidemic spreading on random surfer networks with optimal interaction radius
- Cost-effective anti-rumor message-pushing schemes
- Optimal resource distribution between protection and redundancy considering the time and uncertainties of attacks
- A method of sequential log-convex programming for engineering design
- Social interactions and the prophylaxis of SI epidemics on networks
- Optimal containment of epidemics over temporal activity-driven networks
- The impact of patch forwarding on the prevalence of computer virus: a theoretical assessment approach
- Disciplined geometric programming
- A theoretical method for assessing disruptive computer viruses
- A distributed dynamics for virus-spread control
- Optimal curing resource allocation for epidemic spreading processes
- Dominant eigenvalue minimization with trace preserving diagonal perturbation: subset design problem
- Dynamic behaviour of competing memes' spread with alert influence in multiplex social-networks
- Multi-competitive viruses over time-varying networks with mutations and human awareness
- The modeling and analysis of the word-of-mouth marketing
- A discount strategy in word-of-mouth marketing
This page was built for publication: Optimal Resource Allocation for Network Protection Against Spreading Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358409)
