When Is a Network Epidemic Hard to Eliminate?
From MaRDI portal
Publication:2976137
DOI10.1287/moor.2016.0792zbMath1362.92073arXiv1510.06054OpenAlexW2227599708WikidataQ111475515 ScholiaQ111475515MaRDI QIDQ2976137
Kimon Drakopoulos, Asuman Ozdaglar, John N. Tsitsiklis
Publication date: 13 April 2017
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.06054
Related Items
A Metric Space for Point Process Excitations ⋮ Diffusion in Random Networks: Impact of Degree Distribution ⋮ An efficient dynamic allocation mechanism for security in networks of interdependent strategic agents
Cites Work
- Designing a contact process: the piecewise-homogeneous process on a finite set with applications
- Identifying Influential and Susceptible Members of Social Networks
- How to distribute antidote to control epidemics
- Distributing Antidote Using PageRank Vectors
- AN OPTIMAL CONTROL MODEL FOR EBOLA VIRUS DISEASE
- Monotonicity in graph searching
- Recontamination does not help to search a graph
This page was built for publication: When Is a Network Epidemic Hard to Eliminate?