Distributed assessment of the closeness centrality ranking in complex networks

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 43-48

  Wehmuth, Klaus ^a   Ziviani, Artur ^a  

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

Author keywords

Centrality; Closeness; Distributed algorithm; Network science

Indexed keywords

CENTRALITY; CLOSENESS; COMPLEX NETWORKS; COMPUTATIONAL COSTS; DISTRIBUTED IMPLEMENTATION; EXPERIMENTAL EVALUATION; HIGHLY-CORRELATED; LARGE-SCALE NETWORK; NETWORK SCIENCE; NETWORK TOPOLOGY; REAL-WORLD NETWORKS;

ELECTRIC NETWORK TOPOLOGY; PARALLEL ALGORITHMS; WORLD WIDE WEB;

COBALT COMPOUNDS;

EID: 84860563531     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2184356.2184368     Document Type: Conference Paper

References (22)

1. R. Albert and A. Barabasi. Statistical mechanics of complex networks. Reviews of modern physics, 74(1):47-97, 2002.
2. A. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
3. M. Boguna, R. Pastor-Satorras, A. Diaz-Guilera, and A. Arenas. List of edges of the giant component of the network of users of the Pretty-Good-Privacy algorithm for secure information interchange. Physical Review E, 70(056122), 2004.
4. U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2):163-177, 2001. (Pubitemid 33398479)
5. CAIDA. CAIDA's router-level topology measurements, 2003.
6. M. Ercsey-Ravasz and Z. Toroczkai. Centrality scaling in large networks. Physical Review Letters, 105(3):038701, 2010.
7. P. Erdös and A. Rényi. On random graphs. Publicationes Mathematicae, 6:290-297, 1959.
8. M. Everett and S. Borgatti. Ego network betweenness. Social Networks, 27(1):31-38, 2005. (Pubitemid 40272647)
9. L. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35-41, 1977.
10. 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):619-628, Apr. 2011.
11. H. Kim, J. Tang, R. J. Anderson, and C. Mascolo. Centrality prediction in dynamic human contact networks. Computer Networks, 2012. To appear.
12. K. Lehmann and M. Kaufmann. Decentralized algorithms for evaluating centrality in complex networks. Technical report, Wilhelm Schickard Institut, 2003.
13. J. Leskovec, J. Kleinber, and C. Faloutsos. Graphs over time: Densification laws, shrinking diameters and possible explanations. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), 2005.
14. Y.-S. Lim, D. S. Menasche, B. Ribeiro, D. Towsley, and P. Basu. Online estimating the k central nodes of a network. In Proc. of the IEEE Network Science Workshop (NSW), June 2011.
15. P. Marsden. Egocentric and sociocentric measures of network centrality. Social Networks, 24(4):407-422, Oct. 2002.
16. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In Proc. of the ACM/Usenix Internet Measurement Conference (IMC), San Diego, CA, Oct. 2007.
17. S. Nanda and D. Kotz. Localized bridging centrality for distributed network analysis. In Proc. of Int. Conference on Computer Communications and Networks (ICCCN), pages 1-6. IEEE, Aug. 2008.
18. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
19. M. E. J. Newman. Internet - a symmetrized snapshot of the structure of the internet at the level of autonomous systems, 2006.
20. G. Sabidussi. The centrality index of a graph. Psychometrika, 31(4):581-603, 1966.
21. Z. Shi and B. Zhang. Fast network centrality analysis using GPUs. BMC Bioinformatics, 12(1):149, 2011.
22. K. Wehmuth and A. Ziviani. Distributed algorithm to locate critical nodes to network robustness based on spectral analysis. In Proc. of the Latin American Network Operations and Management Symposium (LANOMS), Oct. 2011.