DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks

We propose a method for the Distributed Assessment of the Closeness CEntrality Ranking (DACCER) in complex networks. DACCER computes centrality based only on localized information restricted to a limited neighborhood around each node, thus not requiring full knowledge of the network topology. We indicate that the node centrality ranking computed by DACCER is highly correlated with the node ranking based on the traditional closeness centrality, which requires high computational costs and full knowledge of the network topology by the entity responsible for calculating the centrality. This outcome is quite useful given the vast potential applicability of closeness centrality, which is seldom applied to large-scale networks due to its high computational costs. Results indicate that DACCER is simple, yet efficient, in assessing node centrality while allowing a distributed implementation that contributes to its performance. This also contributes to the practical applicability of DACCER to the analysis of large complex networks, as indicated in our experimental evaluation using both synthetically generated networks and real-world network traces of different kinds and scales.

[1]  Bruno Ribeiro,et al.  Online estimating the k central nodes of a network , 2011, 2011 IEEE Network Science Workshop.

[2]  Anne-Marie Kermarrec,et al.  Second order centrality: Distributed assessment of nodes criticity in complex networks , 2011, Comput. Commun..

[3]  David Eppstein,et al.  Fast approximation of centrality , 2000, SODA '01.

[4]  Kathleen M. Carley,et al.  k-Centralities: local approximations of global measures based on shortest paths , 2012, WWW.

[5]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[6]  Cynthia M. Lakon,et al.  How Correlated Are Network Centrality Measures? , 2008, Connections.

[7]  David Kotz,et al.  Localized Bridging Centrality for Distributed Network Analysis , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

[8]  M. A. Beauchamp.  AN IMPROVED INDEX OF CENTRALITY. , 1965, Behavioral science.

[9]  Peter V. Marsden,et al.  Egocentric and sociocentric measures of network centrality , 2002, Soc. Networks.

[10]  Alessandro Vespignani,et al.  Complex dynamic networks: Tools and methods , 2012, Comput. Networks.

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

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

[13]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[14]  R. Hanneman.  Introduction to Social Network Methods , 2001 .

[15]  Ronald J. Gutman,et al.  Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.

[16]  Zoltán Toroczkai,et al.  Centrality scaling in large networks. , 2010, Physical review letters.

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

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

[19]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[20]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

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

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

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

[24]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[25]  Roger Wattenhofer,et al.  Optimal distributed all pairs shortest paths and applications , 2012, PODC '12.

[26]  B. Bollobás.  The evolution of random graphs , 1984 .

[27]  Sasu Tarkoma,et al.  Theory and Practice of Bloom Filters for Distributed Systems , 2012, IEEE Communications Surveys & Tutorials.

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

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

[30]  A. Arenas,et al.  Models of social networks based on social distance attachment. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[32]  Hyoungshick Kim,et al.  Influential Neighbours Selection for Information Diffusion in Online Social Networks , 2012, 2012 21st International Conference on Computer Communications and Networks (ICCCN).

[33]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[34]  Artur Ziviani,et al.  Distributed assessment of the closeness centrality ranking in complex networks , 2012, SIMPLEX '12.

[35]  Jeong-Yoo Kim.  Information Diffusion and δ-Closeness-Centrality , 2010 .

[36]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.