The grow ratios on three synthetic networks.

<p>The grow ratios on three synthetic networks.</p

The coverage ratios on three synthetic networks.

<p>The coverage ratios on three synthetic networks.</p

The influence scope with different proportions of spreader on three synthetic networks, where <i>λ</i> = 1.5, <i>β</i> = 1/<<i>k</i>>.

<p>Each data point is obtained by averaging over 200 independent runs.</p

The spreader identification process of our method.

<p>(a) A toy network with 10 nodes and 3 super-nodes; (b) two spreaders identified by our method.</p

The growth ratio on three real networks for three centrality indices.

<p>The growth ratio on three real networks for three centrality indices.</p

The comparisons between our method and the <i>k</i>-medoid method on karate and football networks, where <i>λ</i> = 1.1, <i>β</i> = 1/<<i>k</i>>.

<p>Each data point is obtained by averaging over 100000 independent runs.</p

Statistics on the topological features of the eight networks.

<p> and denote the number of nodes and links. and are the average clustering coefficient and the density of the network, respectively. If a vertex has neighbours, edges could exist among the vertices within the neighbourhood. Thus, the local clustering coefficient for a network can be defined as <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0072908#pone.0072908-Adamic2" target="_blank">[39]</a>, where denotes the neighbours of . is defined as . is defined as . is the modularity of the network defined as <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0072908#pone.0072908-Clauset2" target="_blank">[26]</a>, where denotes a community which includes the vertice and if vertices and are connected and 0 otherwise and if and 0 otherwise. and denote the average degree and the average shortest distance.</p

Accuracy and computational time comparisons between FBM and CAR-based approaches on two noisy PPI networks.

<p>(a) The upper plot illustrates the precision curves for all approaches on the PPI-1 network while the bars in the lower plot illustrate the corresponding AUP (area under precision curve) values for each approach. (b) The upper plot illustrates the precision curves for all approaches on the PPI-2 network while the bars in the lower plot illustrate the corresponding AUP (area under precision curve) values for each approach. The sampling parameter is tuned by 20, 30 and 50 for the FBM approach. The computational time (seconds) for each method is shown in the legend.</p

Comparisons of computational efficiency on four networks.

<p>Each value of running time is the cumulative time for 100 implementations.</p

Three artificial networks illustrating the link formation mechanism in the communities.

<p>Three artificial networks illustrating the link formation mechanism in the communities.</p