Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models
From MaRDI portal
Publication:5073507
DOI10.1137/20M1377011zbMath1490.92120arXiv2011.11087OpenAlexW3109783001WikidataQ113268738 ScholiaQ113268738MaRDI QIDQ5073507
Yuhao Yi, Karl Henrik Johansson, Liren Shan, Philip E. Paré
Publication date: 3 May 2022
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.11087
Epidemiology (92D30) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal link removal for epidemic mitigation: A two-way partitioning approach
- M-matrix characterizations. I: nonsingular M-matrices
- An individual-based approach to SIR epidemics in contact networks
- Thresholds for virus spread on networks
- Multi-competitive viruses over time-varying networks with mutations and human awareness
- How to distribute antidote to control epidemics
- Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
- An analysis of approximations for maximizing submodular set functions—I
- The Many Proofs and Applications of Perron's Theorem
- Optimizing Leader Influence in Networks Through Selection of Direct Followers
- Epidemic Processes Over Time-Varying Networks
- Foundations of Data Science
- Optimal Resource Allocation for Network Protection Against Spreading Processes
- Maximizing Social Influence in Nearly Optimal Time
- An Inverse Matrix Adjustment Arising in Discriminant Analysis
- Analysis and Distributed Control of Periodic Epidemic Processes
This page was built for publication: Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models