Identifying Influential Nodes in Complex Networks: A Multiple Attributes Fusion Method

How to identify influential nodes is still an open hot issue in complex networks. Lots of methods (e.g., degree centrality, betweenness centrality or K-shell) are based on the topology of a network. These methods work well in scale-free networks. In order to design a universal method suitable for networks with different topologies, this paper proposes a Multiple Attribute Fusion (MAF) method through combining topological attributes and diffused attributes of a node together. Two fusion strategies have been proposed in this paper. One is based on the attribute union (FU), and the other is based on the attribute ranking (FR). Simulation results in the Susceptible-Infected (SI) model show that our proposed method gains more information propagation efficiency in different types of networks.

[1]  Cameron Marlow,et al.  A 61-million-person experiment in social influence and political mobilization , 2012, Nature.

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

[3]  Hui Gao,et al.  Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering , 2013, PloS one.

[4]  M. Barthelemy.  Betweenness centrality in large complex networks , 2003, cond-mat/0309436.

[5]  Deng Hong-zhong.  Evaluation Method for Node Importance based on Node Contraction in Complex Networks , 2006 .

[6]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  S. Mahadevan,et al.  A modified evidential methodology of identifying influential nodes in weighted networks , 2013 .

[8]  Soumen Roy,et al.  Resilience and rewiring of the passenger airline networks in the United States. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Tao Zhou,et al.  Epidemic spread in weighted scale-free networks , 2004, cond-mat/0408049.

[10]  Ye Ye,et al.  Evolution of emotions on networks leads to the evolution of cooperation in social dilemmas , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Wang Bing-Hong,et al.  Node importance ranking of complex networks , 2013 .

[12]  Zhou Tao,et al.  Epidemic Spread in Weighted Scale-Free Networks , 2005 .

[13]  Zhi-Xi Wu,et al.  Opinion Spreading And Consensus Formation On Square Lattice , 2007 .

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

[15]  Marco Tomassini,et al.  Worldwide spreading of economic crisis , 2010, 1008.3893.

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

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

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

[19]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[20]  Ning Zhong,et al.  Network immunization and virus propagation in email networks: experimental evaluation and analysis , 2010, Knowledge and Information Systems.

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

[22]  Liu Zun,et al.  Key nodes in complex networks identified by multi-attribute decision-making method , 2013 .

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

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

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

[26]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.