Analysis of the Dynamic Influence of Social Network Nodes

In recent years, with the development of the social network theories, how to find or mining the most significant node in social network for understanding or controlling the information dissemination has become a hot topic and a series of effective algorithms have been presented. In this paper, a new scheme to measure the dynamic influence of the nodes in a social network is proposed, in which the sum of trust values of the propagation nodes is used. Simulations have been carried out and the results show that our scheme is stable and accurate.

[1]  Herbert W. Hethcote,et al.  The Mathematics of Infectious Diseases , 2000, SIAM Rev..

[2]  Agata Fronczak,et al.  Average path length in random networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

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

[5]  L. Allen.  Some discrete-time SI, SIR, and SIS epidemic models. , 1994, Mathematical biosciences.

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

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

[8]  A. Barreiras.  Diameter Constrained Network , 2009 .

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

[10]  B. Shulgin,et al.  Pulse vaccination strategy in the SIR epidemic model , 1998, Bulletin of mathematical biology.

[11]  Lukasz Kowalik,et al.  Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures , 2006, ISAAC.

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

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

[14]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

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

[16]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[17]  Nicholas A. Christakis,et al.  Connected : the surprising power of our social networks and how they shape our lives--how your friends' friends' friends affect everything you feel, think, and do , 2011 .

[18]  Marco Rosa,et al.  Four degrees of separation , 2011, WebSci '12.

[19]  Dorothea Wagner,et al.  Approximating Clustering Coefficient and Transitivity , 2005, J. Graph Algorithms Appl..

[20]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[21]  O. Diekmann,et al.  Mathematical Epidemiology of Infectious Diseases: Model Building, Analysis and Interpretation , 2000 .

[22]  Noah E. Friedkin,et al.  Theoretical Foundations for Centrality Measures , 1991, American Journal of Sociology.

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

[24]  Marko Bajec,et al.  Self-similar scaling of density in complex real-world networks , 2011, ArXiv.

[25]  I. N. A. C. I. J. H. Fowler.  Book Review: Connected: The surprising power of our social networks and how they shape our lives. , 2009 .

[26]  Huan Liu,et al.  Relational learning via latent social dimensions , 2009, KDD.

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

[28]  Mikko Kivelä,et al.  Generalizations of the clustering coefficient to weighted complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  M. Zelen,et al.  Rethinking centrality: Methods and examples☆ , 1989 .

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

[31]  P. Erdos,et al.  On maximal paths and circuits of graphs , 1959 .

[32]  Frank Diederich,et al.  Mathematical Epidemiology Of Infectious Diseases Model Building Analysis And Interpretation , 2016 .