Figure 6: Comparison of competing methods.
From: Efficient collective influence maximization in cascading processes with first-order transitions
Performance of different methods for (a) ER network (N = 104, 〈k〉 = 6, t = 0.5) and (b) scale-free network (N = 104, γ = 3, t = 0.5). In addition to the methods we have examined in the main text, we also display the results of Greedy Algorithm (GA), Betweenness Centrality (BC), Closeness Centrality (CC) and Max-Sum (MS). We set the parameter T = 40 in MS and implement reinforcement with parameter r = 10−4. The inset displays the run time of CI-TM (L = 3) on ER networks (〈k〉 = 6, t = 0.5). The dashed line is power-law fitting.
