Figure 4
From: Locating multiple diffusion sources in time varying networks from sparse observations
Normalized observable range nOR as a function of the fraction p of messenger nodes for three empirical networks: Hospital, High School, and ACM. The time windows for (a) and (b) are one hour and one day, respectively. A greedy algorithm for finding the messenger nodes is used. The theoretical predictions (the solid curves) are from nOR(Q) ≈ ∑i∈Q(l i  + 1)/N. Details of the empirical networks and the meaning of the time window can be found in Table S1 and Sec. S4 in SI.
