M-Centrality: identifying key nodes based on global position and local degree variation

[1]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Wang Bing-Hong,et al.  Node importance measurement based on the degree and clustering coefficient information , 2013 .

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

[4]  Wenxin Yu,et al.  A Novel and Improved Firefly Algorithm Based on Two-order Oscillation , 2017 .

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

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

[7]  Alistair Moffat,et al.  A similarity measure for indefinite rankings , 2010, TOIS.

[8]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[9]  Keshav Pingali,et al.  Betweenness centrality: algorithms and implementations , 2013, PPoPP '13.

[10]  Hongming Mo,et al.  Evidential method to identify influential nodes in complex networks , 2015 .

[11]  Sebastiano Vigna,et al.  Axioms for Centrality , 2013, Internet Math..

[12]  Matheus Palhares Viana,et al.  Predicting epidemic outbreak from individual features of the spreaders , 2012, ArXiv.

[13]  Adilson E Motter.  Cascade control and defense in complex networks. , 2004, Physical review letters.

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

[15]  Leandros Tassiulas,et al.  Detecting Influential Spreaders in Complex, Dynamic Networks , 2013, Computer.

[16]  Hua Yu,et al.  The node importance in actual complex networks based on a multi-attribute ranking method , 2015, Knowl. Based Syst..

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

[18]  John Yen,et al.  Analyzing the Resilience of Complex Supply Network Topologies Against Random and Targeted Disruptions , 2011, IEEE Systems Journal.

[19]  Discretizing the SI Epidemic Model , 2014 .

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

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

[22]  Chao Gao,et al.  Combination methods for identifying influential nodes in networks , 2015 .

[23]  Ya Zhao,et al.  Fast ranking influential nodes in complex networks using a k-shell iteration factor , 2016 .

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

[25]  Jianguo Liu,et al.  Identifying the node spreading influence with largest k-core values , 2014 .

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

[27]  Luis E C Rocha,et al.  Exploiting Temporal Network Structures of Human Interaction to Effectively Immunize Populations , 2010, PloS one.

[28]  Xiaoling Chen,et al.  Information-Theoretic-Entropy Based Weight Aggregation Method in Multiple-Attribute Group Decision-Making , 2016, Entropy.

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

[30]  A. Fatemi,et al.  Influential nodes ranking in complex networks: An entropy-based approach , 2017 .

[31]  Qiang Guo,et al.  Locating influential nodes via dynamics-sensitive centrality , 2015, Scientific Reports.

[32]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[34]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

[35]  Yong Hu,et al.  A new closeness centrality measure via effective distance in complex networks. , 2015, Chaos.

[36]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[37]  Andrew Beveridge,et al.  Network of Thrones , 2016 .

[38]  David A. Bader,et al.  Local Community Detection in Dynamic Graphs Using Personalized Centrality , 2017, Algorithms.

[39]  Jinhu Lü,et al.  Iterative Neighbour-Information Gathering for Ranking Nodes in Complex Networks , 2017, Scientific Reports.

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

[41]  Jennifer Widom,et al.  Scaling personalized web search , 2003, WWW '03.

[42]  P. K. Mishra,et al.  Discussion on Damping Factor Value in PageRank Computation , 2017 .

[43]  Duanbing Chen,et al.  Identifying Influential Spreaders by Weighted LeaderRank , 2013, ArXiv.

[44]  Weiren Shi,et al.  Evaluating the importance of nodes in complex networks , 2016 .

[45]  Vladimir Batagelj,et al.  Some analyses of Erdős collaboration graph , 2000, Soc. Networks.

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

[47]  Jian-Guo Liu,et al.  Iterative resource allocation based on propagation feature of node for identifying the influential nodes , 2015, ArXiv.

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

[49]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[50]  Alessandro Vespignani,et al.  Immunization of complex networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.