A systematic survey on influential spreaders identification in complex networks with a focus on K-shell based techniques

Abstract Almost all the complex interactions between humans, animals, biological cells, neurons, or any other objects are now modeled as a graph with the nodes as the objects of interest and interactions as the edges. The identification of the most central or influential node in such a complex network has many practical applications in diverse domains such as viral marketing, infectious disease spreading, rumor spreading in a social network, virus/worm spreading in computer networks, etc. Many centrality measures using the position/location of a node and network structure have been proposed in the literature. The node degree, shortest paths(closeness), and betweenness are used since long with degree capturing local effect and others global effect. The k-shell considers the coreness of the nodes by dividing the network into layers or shells. Many variations of k-shell proposed in recent years, as well as many researchers, use k-shell as a building block in their heuristic technique to alleviate the problems of classical k-shell and to identify influential spreaders more elegantly. The main objective of this paper is to analyze and compare the major variations of the k-shell based methods along with representative network topology based hybrid techniques by considering a toy network with detailed computations. A discussion on different performance evaluation metrics and, simulation models such as the SIR epidemic model, has been undertaken with a comparative analysis between different state-of-the-art on a few standard real networks.

[1]  Giridhar Maji,et al.  Influential spreaders identification in complex networks with potential edge weight based k-shell degree neighborhood method , 2020, J. Comput. Sci..

[2]  Mohammad Ali Nematbakhsh,et al.  Identification of multi-spreader users in social networks for viral marketing , 2017, J. Inf. Sci..

[3]  Ming Tang,et al.  Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics , 2015, Scientific Reports.

[4]  Masahiro Kimura,et al.  Prediction of Information Diffusion Probabilities for Independent Cascade Model , 2008, KES.

[5]  Tao Zhou,et al.  The H-index of a network node and its relation to degree and coreness , 2016, Nature Communications.

[6]  Ahmad Zareie,et al.  A hierarchical approach for influential node ranking in complex social networks , 2018, Expert Syst. Appl..

[7]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[8]  Sule Gündüz Ögüdücü,et al.  Identifying topical influencers on twitter based on user behavior and network topology , 2018, Knowl. Based Syst..

[9]  Michael Ley,et al.  The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives , 2002, SPIRE.

[10]  Hernán A. Makse,et al.  Collective Influence Algorithm to find influencers via optimal percolation in massively large social media , 2016, Scientific Reports.

[11]  Yiping Yao,et al.  Identifying all-around nodes for spreading dynamics in complex networks , 2012 .

[12]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Jinhong Jung,et al.  Random walk-based ranking in signed social networks: model and algorithms , 2019, Knowledge and Information Systems.

[14]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[15]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[16]  Zhi-Dan Zhao,et al.  Identifying a set of influential spreaders in complex networks , 2016, Scientific Reports.

[17]  Marko Bajec,et al.  Robust network community detection using balanced propagation , 2011, ArXiv.

[18]  Yabing Yao,et al.  Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient , 2018 .

[19]  Ingemar Nåsell,et al.  The quasi-stationary distribution of the closed endemic sis model , 1996, Advances in Applied Probability.

[20]  Joel H. Spencer,et al.  Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.

[21]  Zili Zhang,et al.  Centrality measure in weighted networks based on an amoeboid algorithm , 2012 .

[22]  P. Bonacich Factoring and weighting approaches to status scores and clique identification , 1972 .

[23]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[24]  Mathieu Bastian,et al.  Gephi: An Open Source Software for Exploring and Manipulating Networks , 2009, ICWSM.

[25]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[26]  Y. Moreno,et al.  Epidemic outbreaks in complex heterogeneous networks , 2001, cond-mat/0107267.

[27]  Fan Yang,et al.  Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization , 2019, Physica A: Statistical Mechanics and its Applications.

[28]  M. Kendall The treatment of ties in ranking problems. , 1945, Biometrika.

[29]  Zhiming Zheng,et al.  Searching for superspreaders of information in real-world social media , 2014, Scientific Reports.

[30]  J. Kleinberg Algorithmic Game Theory: Cascading Behavior in Networks: Algorithmic and Economic Issues , 2007 .

[31]  Hassan Badir,et al.  Identification of influential spreaders in complex networks using HybridRank algorithm , 2018, Scientific Reports.

[32]  Yanyu Zhao,et al.  Identifying influential nodes in complex networks based on Neighbours and edges , 2018, Peer-to-Peer Networking and Applications.

[33]  Lucas C Parra,et al.  Finding influential nodes for integration in brain networks using optimal percolation theory , 2018, Nature Communications.

[34]  Jie Shan,et al.  An exploratory analysis on the evolution of the US airport network , 2014 .

[35]  Erez Shmueli,et al.  Active viral marketing: Incorporating continuous active seeding efforts into the diffusion model , 2018, Expert Syst. Appl..

[36]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[37]  Chuang Ma,et al.  Identifying influential spreaders in complex networks based on gravity formula , 2015, ArXiv.

[38]  Jun Ma,et al.  Identifying and ranking influential spreaders in complex networks with consideration of spreading probability , 2017 .

[39]  Yamir Moreno,et al.  The Dynamics of Protest Recruitment through an Online Network , 2011, Scientific reports.

[40]  Biswanath Dutta,et al.  Weighted kshell degree neighborhood: A new method for identifying the influential spreaders from a variety of complex network connectivity structures , 2020, Expert Syst. Appl..

[41]  Ning Ma,et al.  SuperedgeRank algorithm and its application in identifying opinion leader of online public opinion supernetwork , 2014, Expert Syst. Appl..

[42]  Yang Wang,et al.  Identifying and quantifying potential super-spreaders in social networks , 2019, Scientific Reports.

[43]  Ping Wang,et al.  A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks , 2020, Knowl. Based Syst..

[44]  Yabing Yao,et al.  An adaptive discrete particle swarm optimization for influence maximization based on network community structure , 2019, International Journal of Modern Physics C.

[45]  An Zeng,et al.  Optimal tree for both synchronizability and converging time , 2009 .

[46]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[47]  Mahdi Jalili,et al.  Identification of influential users in social network using gray wolf optimization algorithm , 2020, Expert Syst. Appl..

[48]  Yuval Shavitt,et al.  A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.

[49]  M. Keeling,et al.  Modeling Infectious Diseases in Humans and Animals , 2007 .

[50]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[51]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[52]  An Zeng,et al.  Iterative resource allocation for ranking spreaders in complex networks , 2014 .

[53]  Yong Deng,et al.  Weighted k-shell decomposition for complex networks based on potential edge weights , 2015 .

[54]  Hernán A. Makse,et al.  Efficient collective influence maximization in cascading processes with first-order transitions , 2016, Scientific Reports.

[55]  Sangwook Kim,et al.  Identifying and ranking influential spreaders in complex networks by neighborhood coreness , 2014 .

[56]  Keyhan Khamforoosh,et al.  Influence maximization in social networks based on TOPSIS , 2018, Expert Syst. Appl..

[57]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1998, SODA '98.

[58]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[59]  Ming Tang,et al.  Identify influential spreaders in complex networks, the role of neighborhood , 2015, ArXiv.

[60]  Frank Schweitzer,et al.  A k-shell decomposition method for weighted networks , 2012, ArXiv.

[61]  Mark E. J. Newman A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[62]  Réka Albert,et al.  Structural vulnerability of the North American power grid. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[63]  Yiannis Kompatsiaris,et al.  Multilabel user classification using the community structure of online networks , 2017, PloS one.

[64]  Seyed Mojtaba Hosseini Bamakan,et al.  Opinion leader detection: A methodological review , 2019, Expert Syst. Appl..

[65]  Phillip Bonacich,et al.  Some unique properties of eigenvector centrality , 2007, Soc. Networks.

[66]  Zili Zhang,et al.  A hybrid strategy for network immunization , 2018 .

[67]  Bo Zhang,et al.  A most influential node group discovery method for influence maximization in social networks: A trust-based perspective , 2019, Data Knowl. Eng..

[68]  Yi-Cheng Zhang,et al.  Leaders in Social Networks, the Delicious Case , 2011, PloS one.

[69]  An Zeng,et al.  Ranking spreaders by decomposing complex networks , 2012, ArXiv.

[70]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[71]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[72]  Alireza Abdollahpouri,et al.  Ranking nodes in complex networks based on local structure and improving closeness centrality , 2019, Neurocomputing.

[73]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[74]  Paolo Massa,et al.  Bowling Alone and Trust Decline in Social Network Sites , 2009, 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing.

[75]  Xiaoqi Ma,et al.  Identifying influential spreaders by gravity model , 2019, Scientific Reports.

[76]  Huiyan Kang,et al.  Epidemic spreading and global stability of an SIS model with an infective vector on complex networks , 2015, Commun. Nonlinear Sci. Numer. Simul..

[77]  Claudio Castellano,et al.  Thresholds for epidemic spreading in networks , 2010, Physical review letters.

[78]  Claudio Castellano,et al.  Leveraging percolation theory to single out influential spreaders in networks , 2016, Physical review. E.

[79]  Canshi Zhu,et al.  A novel method of evaluating key nodes in complex networks , 2017 .

[80]  Allan Borodin,et al.  Threshold Models for Competitive Influence in Social Networks , 2010, WINE.

[81]  Mark S. Granovetter Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[82]  Xiaoge Zhang,et al.  A Bio-Inspired Methodology of Identifying Influential Nodes in Complex Networks , 2013, PloS one.

[83]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

[84]  J. Coleman Introduction to Mathematical Sociology , 1965 .

[85]  Neo D. Martinez Artifacts or Attributes? Effects of Resolution on the Little Rock Lake Food Web , 1991 .

[86]  Hao Liao,et al.  Overlapping influence inspires the selection of multiple spreaders in complex networks , 2018, Physica A: Statistical Mechanics and its Applications.

[87]  Ming Tang,et al.  Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition , 2014, Scientific Reports.

[88]  Mahdi Jalili,et al.  Influential node ranking in social networks based on neighborhood diversity , 2019, Future Gener. Comput. Syst..

[89]  M. Newman Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[90]  Vladimir Batagelj,et al.  Pajek - Program for Large Network Analysis , 1999 .

[91]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[92]  Ahmad Zareie,et al.  EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networks , 2019, Physica A: Statistical Mechanics and its Applications.

[93]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[94]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

[95]  Mariana Curado Malta,et al.  Influential spreaders identification in complex networks with improved k-shell hybrid method , 2020, Expert Syst. Appl..

[96]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[97]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[98]  W. Knight A Computer Method for Calculating Kendall's Tau with Ungrouped Data , 1966 .

[99]  Biswanath Dutta,et al.  Identifying influential spreaders in complex networks based on kshell hybrid method , 2018, Physica A: Statistical Mechanics and its Applications.

[100]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[101]  Qiang Guo,et al.  Ranking the spreading influence in complex networks , 2013, ArXiv.

[102]  Feng Li,et al.  Maximizing micro-blog influence in online promotion , 2017, Expert Syst. Appl..

[103]  Hernán A. Makse,et al.  Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks , 2016, Scientific Reports.

[104]  Kezan Li,et al.  A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks , 2017 .