Extracting edge centrality from social networks using heat diffusion algorithm

Social networks are generally sets of individuals or organizations that are connected with one or more links. Usually, social networks are presented by undirected graphs, where the set of vertices V and the set of edges E state the individuals and relation between them respectively. One of the most applicable problems in these networks is the centrality values allocation problem to the vertices and edges. Recently, a new evaluation criterion for the edge centrality so called centrality index of k paths has been proposed which is based on intranet issuing the messages along with random paths composed of k edges. From the other side, it has been vivid the importance of computing the edges centrality through these years. In this study, by referring to message propagation along random paths, a new diffusion model was reached by applying heat diffusion algorithm. This model was based such that the vertex on the way of heat diffusion of most of vertices could be considered as an important node and it could obtain centrality edges by scoring the edges on the heat diffusion path. The proposed technique was compared with centrality drawing method by means of random paths of length k and the results of analyzing the algorithm performance on online large social networks’ data set show a remarkable efficacy of the proposed method to the mentioned method. Utilizing known large social networks in evaluation proves the efficiency of the proposed method for analyzing the large scale network.

[1]  Luciano Rossoni,et al.  Models and methods in social network analysis , 2006 .

[2]  N. Madras,et al.  THE SELF-AVOIDING WALK , 2006 .

[3]  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.

[4]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[5]  Ulrik Brandes,et al.  Centrality Estimation in Large Networks , 2007, Int. J. Bifurc. Chaos.

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

[7]  Noah E. Friedkin,et al.  Horizons of Observability and Limits of Informal Control in Organizations , 1983 .

[8]  Pasi Fränti,et al.  Web Data Mining , 2009, Encyclopedia of Database Systems.

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

[10]  Stefan Richter,et al.  Centrality Indices , 2004, Network Analysis.

[11]  K. Pauwels,et al.  Effects of Word-of-Mouth versus Traditional Marketing: Findings from an Internet Social Networking Site , 2009 .

[12]  John D. Lafferty,et al.  Diffusion Kernels on Graphs and Other Discrete Input Spaces , 2002, ICML.

[13]  David A. Bader,et al.  Approximating Betweenness Centrality , 2007, WAW.

[14]  Pasquale De Meo,et al.  A Novel Measure of Edge Centrality in Social Networks , 2012, Knowl. Based Syst..

[15]  Michael R. Lyu,et al.  DiffusionRank: a possible penicillin for web spamming , 2007, SIGIR.

[16]  J. Anthonisse.  The rush in a directed graph , 1971 .

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

[18]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[19]  Adriana Iamnitchi,et al.  K-path centrality: a new centrality measure in social networks , 2011, SNS '11.

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

[21]  N. Lee,et al.  Word of mouth communication within online communities: Conceptualizing the online social network , 2007 .

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

[23]  John D. Lafferty,et al.  Diffusion Kernels on Statistical Manifolds , 2005, J. Mach. Learn. Res..

[24]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[25]  Ulrik Brandes,et al.  Centrality Measures Based on Current Flow , 2005, STACS.

[26]  Ulrik Brandes,et al.  On variants of shortest-path betweenness centrality and their generic computation , 2008, Soc. Networks.

[27]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[28]  Steffen Staab,et al.  Social Networks Applied , 2005, IEEE Intell. Syst..

[29]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .