Name
Abstract | ||
|---|---|---|
The way diseases spread through schools, epidemics through countries, and viruses through the internet is crucial in determining their risk. Although each of these threats has its own characteristics, its underlying network determines the spreading. To restrain the spreading, a widely used approach is the fragmentation of these networks through immunization, so that epidemics cannot spread. Here we develop an immunization approach based on optimizing the susceptible size, which outperforms the best known strategy based on immunizing the highest-betweenness links or nodes. We find that the network's vulnerability can be significantly reduced, demonstrating this on three different real networks: the global flight network, a school friendship network, and the internet. In all cases, we find that not only is the average infection probability significantly suppressed, but also for the most relevant case of a small and limited number of immunization units the infection probability can be reduced by up to 55%. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1103/PhysRevE.84.061911 | PHYSICAL REVIEW E |
Keywords | Field | DocType |
betweenness centrality,percolation theory | Friendship,Computer security,Computer science,Betweenness centrality,Pandemic,Vulnerability | Journal |
Volume | Issue | ISSN |
84 | 6 | 2470-0045 |
Citations | PageRank | References |
9 | 0.56 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian M. Schneider | 1 | 142 | 8.29 |
| Tamara Mihaljev | 2 | 11 | 0.93 |
| Shlomo Havlin | 3 | 834 | 65.29 |
| Hans J. Herrmann | 4 | 186 | 17.58 |