A Novel Measure of Edge Centrality in Social Networks

The problem of assigning centrality values to nodes and edges in graphs has been widely investigated during last years. Recently, a novel measure of node centrality has been proposed, called @k-path centrality index, which is based on the propagation of messages inside a network along paths consisting of at most @k edges. On the other hand, the importance of computing the centrality of edges has been put into evidence since 1970s by Anthonisse and, subsequently by Girvan and Newman. In this work we propose the generalization of the concept of @k-path centrality by defining the @k-path edge centrality, a measure of centrality introduced to compute the importance of edges. We provide an efficient algorithm, running in O(@km), being m the number of edges in the graph. Thus, our technique is feasible for large scale network analysis. Finally, the performance of our algorithm is analyzed, discussing the results obtained against large online social network datasets.

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

[2]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

[3]  ZhengYou Xia,et al.  Community detection based on a semantic network , 2012, Knowl. Based Syst..

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

[5]  Young Ae Kim,et al.  Strategies for predicting local trust based on trust propagation in social networks , 2011, Knowl. Based Syst..

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

[7]  M. Narasimha Murty,et al.  Knowledge-based clustering approach for data abstraction , 1994, Knowl. Based Syst..

[8]  Ashraf Aboulnaga,et al.  Schema clustering and retrieval for multi-domain pay-as-you-go data integration systems , 2010, SIGMOD Conference.

[9]  Alfredo Garro,et al.  X-Learn: An XML-Based, Multi-agent System for Supporting "User-Device" Adaptive E-learning , 2003, CoopIS/DOA/ODBASE.

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

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

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

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

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

[15]  Massimo Marchiori,et al.  Method to find community structures based on information centrality. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  S. Globali,et al.  IEEE INTELLIGENT SYSTEMS , 2022, IEEE MultiMedia.

[17]  María Guadalupe Ramírez Ortiz,et al.  The social networks of academic performance in a student context of poverty in Mexico , 2004, Soc. Networks.

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

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

[20]  Martin G. Everett,et al.  A Graph-theoretic perspective on centrality , 2006, Soc. Networks.

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

[22]  Marko A. Rodriguez,et al.  Grammar-based geodesics in semantic networks , 2010, Knowl. Based Syst..

[23]  Giovanni Quattrone,et al.  Finding reliable users and social networks in a social internetworking system , 2009, IDEAS '09.

[24]  ZhengYou Xia.  Fighting criminals: Adaptive inferring and choosing the next investigative objects in the criminal network , 2008, Knowl. Based Syst..

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

[26]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

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

[28]  Michael Garland,et al.  Social Network Clustering and Visualization using Hierarchical Edge Bundles , 2011, Comput. Graph. Forum.

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

[30]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

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

[32]  Eric Tsui,et al.  Knowledge management perspective on e-learning effectiveness , 2009, Knowl. Based Syst..

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

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

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

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

[37]  Martin Everett,et al.  Ego network betweenness , 2005, Soc. Networks.

[38]  Pasquale De Meo,et al.  Generalized Louvain method for community detection in large networks , 2011, 2011 11th International Conference on Intelligent Systems Design and Applications.

[39]  Alon Y. Halevy,et al.  Data Integration for the Relational Web , 2009, Proc. VLDB Endow..

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

[41]  Marko A. Rodriguez,et al.  Grammar-based random walkers in semantic networks , 2008, Knowl. Based Syst..

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

[43]  Brandon Dixon,et al.  A relation context oriented approach to identify strong ties in social networks , 2011, Knowl. Based Syst..

[44]  Robin I. M. Dunbar.  Grooming, Gossip and the Evolution of Language , 1996 .

[45]  David A. Bader,et al.  National Laboratory Lawrence Berkeley National Laboratory Title A Faster Parallel Algorithm and Efficient Multithreaded Implementations for Evaluating Betweenness Centrality on Massive Datasets Permalink , 2009 .

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