Collective Influence Algorithm to find influencers via optimal percolation in massively large social media

Authors

Flaviano Morone, CUNY City College
Byungjoon Min, CUNY City CollegeFollow
Lin Bo, CUNY City College
Romain Mari, CUNY City College
Hernán A. Makse, CUNY City CollegeFollow

Document Type

Article

Publication Date

7-26-2016

Abstract

We elaborate on a linear-time implementation of Collective-Influence (CI) algorithm introduced by Morone, Makse, Nature 524, 65 (2015) to find the minimal set of influencers in networks via optimal percolation. The computational complexity of CI is O(N log N) when removing nodes one-by-one, made possible through an appropriate data structure to process CI. We introduce two Belief-Propagation (BP) variants of CI that consider global optimization via message-passing: CI propagation (CIP) and Collective- Immunization-Belief-Propagation algorithm (CIBP) based on optimal immunization. Both identify a slightly smaller fraction of influencers than CI and, remarkably, reproduce the exact analytical optimal percolation threshold obtained in Random Struct. Alg. 21, 397 (2002) for cubic random regular graphs, leaving little room for improvement for random graphs. However, the small augmented performance comes at the expense of increasing running time to O(N2), rendering BP prohibitive for modern-day big-data. For instance, for big-data social networks of 200 million users (e.g., Twitter users sending 500 million tweets/day), CI finds influencers in 2.5 hours on a single CPU, while all BP algorithms (CIP, CIBP and BDP) would take more than 3,000 years to accomplish the same task.

Comments

This article was originally published in Scientific Reports, available at DOI: 10.1038/srep30062.

This work is licensed under a Creative Commons Attribution 4.0 International License.