Perturb and Combine to Identify Influential Spreaders in Real-World Networks

Abstract : Graph degeneracy algorithms were recently shown to be very effective at detecting the influential spreaders in a network. However, degeneracy-based decompositions of a graph are unstable to small perturbations of the network structure. At the same time, it is well-known in Machine Learning that the performance of unstable algorithms can be greatly improved by using Perturb and Combine (P&C) strategies. Motivated by these observations, we propose a P&C procedure for networks that (1) creates many perturbed versions of a given graph, (2) applies the same algorithm separately to each graph, and (3) combines the results. Experiments conducted on benchmark datasets of real-world networks reveal that our strategy improves the performance of all algorithms tested. Moreover, this performance boost can be obtained at almost no extra cost through parallelization. We finally provide insights as to why our strategy is effective from a theoretical perspective. To the best of our knowledge, this work is the first application of P&C to networks.
Liste complète des métadonnées
Contributeur : Fragkiskos Malliaros <>
Soumis le : mardi 18 décembre 2018 - 13:23:26
Dernière modification le : mercredi 23 janvier 2019 - 10:29:21


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01958973, version 1


Antoine J.-P. Tixier, Maria Evgenia G. Rossi, Fragkiskos Malliaros, Jesse Read, Michalis Vazirgiannis. Perturb and Combine to Identify Influential Spreaders in Real-World Networks. 2018. 〈hal-01958973〉



Consultations de la notice


Téléchargements de fichiers