Identifying highly influential nodes in multilayer networks based on global propagation.

Based on percolation theory and the independent cascade model, this paper considers the selection of the optimal propagation source when the propagation probability is greater than the percolation threshold. First, based on the percolation characteristics of real networks, this paper presents an iterative algorithm of linear complexity to solve the probability of the propagation source transmitting information to the network's giant component, that is, the global propagation probability. Compared with the previous multiple local simulation algorithm, this algorithm eliminates random errors and significantly reduces the operation time. A sufficient and necessary condition is provided, and it is proved that the final propagation range of the propagation source obeys the bimodal distribution. Based on this sufficient and necessary condition, we extend the efficient iterative algorithm proposed in this article to multi-layer networks and find that for two-layer networks, the final propagation range of the propagation source follows a four-peak distribution. Through iterations and calculations, the probability of each peak and the number of nodes included can be directly obtained, and the propagation expectations of the nodes in the multi-layer network can then be calculated, which can result in a better ranking of the propagation influence of the nodes. In addition, to maximize the influence of multi-propagation sources, this paper also presents a de-overlapping method, which has evident advantages over traditional methods.

[1]  M. Bawendi,et al.  (CdSe)ZnS Core-Shell Quantum Dots - Synthesis and Characterization of a Size Series of Highly Luminescent Nanocrystallites , 1997 .

[2]  H. Stanley,et al.  Networks formed from interdependent networks , 2011, Nature Physics.

[3]  Shlomo Havlin,et al.  Local structure can identify and quantify influential global spreaders in large scale social networks , 2015, Proceedings of the National Academy of Sciences.

[4]  K. Sycara,et al.  Polarity Related Influence Maximization in Signed Social Networks , 2014, PloS one.

[5]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[6]  Mohammad Ali Nematbakhsh,et al.  IMPROVING DETECTION OF INFLUENTIAL NODES IN COMPLEX NETWORKS , 2015, ArXiv.

[7]  Liu Zhi,et al.  Evaluating influential spreaders in complex networks by extension of degree , 2015 .

[8]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[9]  Filippo Radicchi,et al.  Percolation in real interdependent networks , 2015, Nature Physics.

[10]  Meir Fershtman,et al.  Cohesive group detection in a social network by the segregation matrix index , 1997 .

[11]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[12]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

[13]  H. Stanley,et al.  Breakdown of interdependent directed networks , 2016, Proceedings of the National Academy of Sciences.

[14]  Amir Bashan,et al.  Percolation of interdependent network of networks , 2015 .

[15]  Piet Van Mieghem,et al.  Epidemic processes in complex networks , 2014, ArXiv.

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

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

[18]  H. Kesten.  The critical probability of bond percolation on the square lattice equals 1/2 , 1980 .

[19]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.