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

Computer Networks

Volumn 57, Issue 13, 2013, Pages 2536-2548

  Wehmuth, Klaus ^a   Ziviani, Artur ^a  

^a LABORATÓRIO NACIONAL DE COMPUTAÇÃO CIENTÍFICA   (Brazil)

Author keywords

Closeness; Network centrality

Indexed keywords

CLOSENESS; CLOSENESS CENTRALITIES; COMPUTATIONAL COSTS; DISTRIBUTED IMPLEMENTATION; EXPERIMENTAL EVALUATION; LARGE-SCALE NETWORK; NETWORK CENTRALITIES; REAL-WORLD NETWORKS;

INTERNET;

ELECTRIC NETWORK TOPOLOGY;

EID: 84880922381     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2013.05.001     Document Type: Article

References (41)

1. R. Albert, and A. Barabási Statistical mechanics of complex networks Reviews of Modern Physics 74 1 2002 47 97
2. M.E.J. Newman The structure and function of complex networks SIAM Review 45 2 2003 167 256
3. G. Sabidussi The centrality index of a graph Psychometrika 31 4 1966 581 603
4. L. Freeman A set of measures of centrality based on betweenness Sociometry 40 1 1977 35 41
5. M. Beauchamp An improved index of centrality Behavioral Science 10 2 1965 161 163
6. P. Bonacich Power and centrality: a family of measures The American Journal of Sociology 92 5 1987 1170 1182
7. R. Albert, H. Jeong, and A. Barabási Error and attack tolerance of complex networks Nature 406 6794 2000 378 382
8. A.-M. Kermarrec, E. Le Merrer, B. Sericola, and G. Trédan Second order centrality: distributed assessment of nodes criticity in complex networks Computer Communications 34 5 2011 619 628
9. J.-Y. Kim Information diffusion and δ-closeness centrality Sociological Theory and Methods 25 1 2010 95 106
10. H. Kim, E. Yoneki, Influential neighbours selection for information diffusion in online social networks, in: Proc. of the IEEE International Conference on Computer Communication Networks (ICCCN), Munich, Germany, 2012, pp. 1-7.
11. M. Fredman, and R. Tarjan Fibonacci heaps and their uses in improved network optimization algorithms Journal of the ACM (JACM) 34 3 1987 596 615
12. M.E.J. Newman Networks 2010 Oxford University Press New York, NY, USA
13. U. Brandes A faster algorithm for betweenness centrality Journal of Mathematical Sociology 25 2 2001 163 177
14. D. Eppstein, and J. Wang Fast approximation of centrality Journal of Graph Algorithms and Applications 8 1 2004 39 45
15. S. Fortunato, M. Boguñá, A. Flammini, and F. Menczer Algorithms and models for the web-graph W. Aiello, A. Broder, J. Janssen, E. Milios, Lecture Notes in Computer Science vol. 49 2008 Springer-Verlag Berlin, Heidelberg pp. 59-71. (Chapter Approximating PageRank from In-Degree)
16. S. Nanda, D. Kotz, Localized bridging centrality for distributed network analysis, in: Proc. of Int. Conference on Computer Communications and Networks (ICCCN), IEEE, St. Thomas - U.S. Virgin Islands, 2008, pp. 1-6.
17. L. Freeman Centrality in social networks conceptual clarification Social Networks 1 3 1979 215 239
18. K. Wehmuth, A. Ziviani, Distributed assessment of the closeness centrality ranking in complex networks, in: Proc. of the Workshop on Simplifying Complex Networks for Practitioners - SIMPLEX, WWW 2012, Lyon, France, 2012, pp. 43-48.
19. R. Gutman, Reach-based routing: a new approach to shortest path algorithms optimized for road networks, in: 6th SIAM Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, USA, 2004, pp. 100-111.
20. R.A. Hannman, and M. Riddle Introduction to Social Network Methods 2005 University of California - Riverside Riverside, CA
21. M. Everett, and S. Borgatti Ego network betweenness Social Networks 27 1 2005 31 38
22. S. Holzer, R. Wattenhofer, Optimal distributed all pairs shortest paths and applications, in: Proc. of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), Madeira, Portugal, 2012, pp. 355-364.
23. Y.-S. Lim, D.S. Menasche, B. Ribeiro, D. Towsley, P. Basu, Online estimating the k central nodes of a network, in: Proc. of the IEEE Network Science Workshop (NSW), West Point, NY, USA, 2011, pp. 118-122.
24. T. Cormen, C. Leiserson, R. Rivest, and C. Stein Introduction to Algorithms 2001 MIT Press Cambridge, MA, USA
25. B.H. Bloom Space/time trade-offs in hash coding with allowable errors Communications of the ACM 13 7 1970 422 426
26. S. Tarkoma, C.E. Rothenberg, and E. Lagerspetz Theory and practice of bloom filters for distributed systems IEEE Communications Surveys and Tutorials 14 1 2012 131 155
27. T. Valente, K. Coronges, C. Lakon, and E. Costenbader How correlated are network centrality measures? Connections 28 1 2008 16 26
28. A. Barabási, and R. Albert Emergence of scaling in random networks Science 286 5439 1999 509 512
29. P. Erdös, and A. Rényi On random graphs Publicationes Mathematicae 6 1959 290 297
30. P. Erdös, and A. Rényi On the evolution of random graphs Publications of the Mathematical Institute of the Hungarian Academy of Sciences 5 1960 17 61
31. A. Mislove, M. Marcon, K.P. Gummadi, P. Druschel, B. Bhattacharjee, Measurement and analysis of online social networks, in: Proc. of the ACM/Usenix Internet Measurement Conference (IMC), San Diego, CA, USA, 2007, pp. 29-42.
32. CAIDA, CAID A's Router-Level Topology Measurements, 2003. < http://www.caida.org/tools/measurement/skitter/router-topology/ >.
33. M. Newman, Internet - A Symmetrized Snapshot of the Structure of the Internet at the Level of Autonomous Systems, 2006. < http://www-personal. umich.edu/mejn/netdata/ >.
34. M. Boguñá, R. Pastor-Satorras, A. Díaz-Guilera, and A. Arenas Models of social networks based on social distance attachment Physical Review E 70 5 2004 056122
35. J. Leskovec, J. Kleinber, C. Faloutsos, Graphs over time: Densification laws, shrinking diameters and possible explanations, in: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), Chicago, IL, USA, 2005, pp. 177-187.
36. T. Alahakoon, R. Tripathi, N. Kourtellis, R. Simha, A. Iamnitchi, K-path centrality: A new centrality measure in social networks, in: Proc. of the Social Network Systems (SNS), Salzburg, Austria, 2011, pp. 1-6.
37. P. Marsden Egocentric and sociocentric measures of network centrality Social Networks 24 4 2002 407 422
38. M. Ercsey-Ravasz, and Z. Toroczkai Centrality scaling in large networks Physical Review Letters 105 3 2010 038701
39. J. Pfeffer, K.M. Carley, k-centralities: local approximations of global measures based on shortest paths, in: Proc. of the International Workshop on Large Scale Network Analysis - LSNA, WWW 2012, Lyon, France, 2012, pp. 1043-1050.
40. A. Barrat, M. Barthélemy, and A. Vespignani Dynamical Processes on Complex Networks 2008 Cambridge University Press Cambridge, UK
41. J.I. Alvarez-Hamelin, E. Fleury, A. Vespignani, and A. Ziviani Complex dynamic networks: tools and methods (Guest Editorial) Computer Networks 56 3 2012 967 969