Efficient Containment of Exact SIR Markovian Processes on Networks
arXiv:1603.04499 · doi:10.1109/CDC.2016.7798393
Abstract
This paper introduces a theoretical framework for the analysis and control of the stochastic susceptible-infected-removed (SIR) spreading process over a network of heterogeneous agents. In our analysis, we analyze the exact networked Markov process describing the SIR model, without resorting to mean-field approximations, and introduce a convex optimization framework to find an efficient allocation of resources to contain the expected number of accumulated infections over time. Numerical simulations are presented to illustrate the effectiveness of the obtained results.
References in corpus (6)
- Epidemic outbreaks in complex heterogeneous networks
- Optimal Resource Allocation for Network Protection Against Spreading Processes
- Stability of Spreading Processes over Time-Varying Large-Scale Networks
- Optimal Patching in Clustered Malware Epidemics
- Epidemic Processes over Adaptive State-Dependent Networks
- Spreading Processes over Socio-Technical Networks with Phase-Type Transmissions