To be able to control spreading phenomena (like the spreading of diseases and information) in networks it is important to identify influential spreaders. What "important" means depends on what is spreading and what kind of countermeasures that are available. In this work, we let the susceptible-infected-removed (SIR) model represent the spreading dynamics and contrast three different definitions of importance: Influence maximization (the expected outbreak size given a set of seed nodes), the effect of vaccination (how much deleting nodes would reduce the expected outbreak size) and sentinel surveillance (how early an outbreak could be detected with sensors at a set of nodes). We calculate the exact expressions of these quantities, as functions of the SIR parameters, for all connected graphs of three to seven nodes. We obtain the smallest graphs where the optimal node sets are not overlapping. We find that: node separation is more important than centrality for more than one active node, that vaccination and influence maximization are the most different aspects of importance, and that the three aspects are more similar when the infection rate is low. Furthermore, we discuss similar approaches to study the extinction times in the susceptible-infected- susceptible model.
3. SIR model
Was proposed by Kermack–McKendrick 1927
Is usually formulated as a differential equation system.
ds
dt
= –βsi—
di
dt
= βsi – νi—
= νidr
dt
—
Ω = r(∞) = 1 – exp[–R₀ Ω]
where R₀ = β/ν
Ω > 0 if and only if R₀ > 1
The epidemic
threshold
5. Three types of importance
Petter Holme, Three faces of node importance in network
epidemiology: Exact results for small graphs, arxiv:
1708.06456.
Inspiration:
• F. Radicchi and C. Castellano. Fundamental difference
between superblockers and superspreaders in networks.
Phys. Rev. E, 95:012318 (2017).
• U. Brandes and J. Hildenbrand. Smallest graphs with
distinct singleton centers. Network Science, 2(3):416–418
(2014).
6. 7
susceptible infectious recovered
t = 0 t = 1 t = 2
t = 3 t = 4 t = 5
0
2
6
4
7
77
0
1
1
2
2 3
4
5
55
(a)
(b) (c) (d)6
6
6
influence
maximization
vaccinization sentinel
surveillance
Three types of importance
7. Three types of importance
Idea:
• Search for the smallest graph with where all three
notions of importance differ.
• Study statistics of node importance vs centrality etc over
all small graphs.
To do that, I can’t use stochastic simulations.
10. Symbolic algebra
Coding progress:
• Started with SymPy (Python) general algebraic
expressions.
• Then used SymPy’s polynomial package (100 times
faster).
• Then FLINT (C) 10000–100000 times faster.
• Then eliminating isomorphic branches of the tree (10
times faster).
https://github.com/pholme/exact-importance
21. Summary
Paper:
• Found smallest connected graphs with three distinct
most important nodes.
• Degree is important for small β.
• Vitality is important for vaccination.
• With more than one active node, the separation
matters for influence maximization and sentinel
surveillance.
Myself:
• Learned efficient symbolic computation.
• Graph isomorphism.
• How to enumerate small graphs.