# Multi-Stage Sparse Resource Allocation for Control of Spreading Processes over Networks

@article{Somers2021MultiStageSR, title={Multi-Stage Sparse Resource Allocation for Control of Spreading Processes over Networks}, author={V.L.J. Somers and Ian R. Manchester}, journal={ArXiv}, year={2021}, volume={abs/2110.07755} }

In this paper we propose a method for sparse dynamic allocation of resources to bound the risk of spreading processes, such as epidemics and wildfires, using convex optimization and dynamic programming techniques. Here, risk is defined as the risk of an undetected outbreak, i.e. the product of the probability of an outbreak occurring over a time interval and the future impact of that outbreak, and we can allocate budgeted resources each time step to bound and minimize the risk. Our method in…

## References

SHOWING 1-10 OF 48 REFERENCES

Sparse Resource Allocation for Control of Spreading Processes via Convex Optimization

- Computer Science, EngineeringIEEE Control Systems Letters
- 2021

In this letter we propose a method for sparse allocation of resources to control spreading processes – such as epidemics and wildfires – using convex optimization, in particular exponential cone…

Minimizing the Risk of Spreading Processes via Surveillance Schedules and Sparse Control

- Engineering, Computer ScienceArXiv
- 2021

An optimization framework that combines surveillance schedules and sparse control to bound the risk of spreading processes such as epidemics and wildfires is proposed and demonstrates with different spreading process examples how the method can incorporate different parameters and scenarios.

Sparse Resource Allocation for Linear Network Spread Dynamics

- Computer ScienceIEEE Transactions on Automatic Control
- 2017

This study considers allocating limited distributed control resources among a subset of a network's nodes, to minimize the dominant eigenvalue of a linear dynamical spread process associated with the network.

Data-Driven Network Resource Allocation for Controlling Spreading Processes

- Mathematics, Computer ScienceIEEE Transactions on Network Science and Engineering
- 2015

A data-driven robust optimization framework to find the optimal allocation of protection resources to eradicate the viral spread at the fastest possible rate and relax the robust optimization problem into a conic geometric program, recently proposed by Chandrasekaran and Shah.

Dynamic Resource Allocation to Control Epidemic Outbreaks A Model Predictive Control Approach

- Computer Science2018 Annual American Control Conference (ACC)
- 2018

This work considers the problem of dynamically allocating limited resources to control a spreading process over a network using Model Predictive Control techniques and iteratively applies vaccines and antidotes at each time step, ensuring that the total expended cost lies within bounds of available resources.

A geometric programming approach for optimal resource allocation to control epidemic outbreaks in arbitrary networks

- Computer Science
- 2018

A mean-field model is presented to describe the spreading dynamics and prove the existence of a necessary and sufficient condition for global exponential stability and another condition to control the spread of an epidemic outbreak in terms of the eigenvalues of a matrix that depends on the network structure and the parameters of the model.

Optimal Resource Allocation for Network Protection Against Spreading Processes

- Computer Science, MathematicsIEEE Transactions on Control of Network Systems
- 2014

Both the 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.

Suppressing Epidemics in Networks Using Priority Planning

- Computer ScienceIEEE Transactions on Network Science and Engineering
- 2016

This paper analyzes a large class of dynamic resource allocation strategies, named priority planning, that aim to suppress SIS epidemics taking place in a network and highlights that the cutwidth, which is the minimum maxcut of all possible linear arrangements for a network, is a fundamental network property that determines the resource budget required to suppress the epidemic.

Distributed Algorithm for Suppressing Epidemic Spread in Networks

- Computer ScienceIEEE Control Systems Letters
- 2018

A distributed algorithm is developed 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 3) given insufficient curing resources, limit the size of an endemic state.

Optimal Resource Allocation for Control of Networked Epidemic Models

- Mathematics, Computer ScienceIEEE Transactions on Control of Network Systems
- 2017

This paper proposes and analyzes a generalized epidemic model over arbitrary directed graphs with heterogeneous nodes. The proposed model, called the generalized–susceptible exposed infected…