Erwan Le Merrer
ABSTRACT
The increase of interest in the analysis of contemporary social networks, for both academic and economic reasons, has highlighted the inherent difficulties in handling large and complex structures. Among the tools provided by researchers for network analysis, the centrality notion, capturing the importance of individuals in a graph, is of particular interest. Despite many definitions and implementations of centrality, no clear advantage is given to a particular paradigm for the study of social network characteristics. In this paper we review, compare and highlight the strengths of different definitions of centralities in contemporary social networks.
- Serge Abiteboul, Mihai Preda, and Gregory Cobena. Adaptive on-line page importance computation. In WWW '03: Proceedings of the 12th international conference on World Wide Web, pages 280--290, New York, NY, USA, 2003. Google Scholar
Digital Library
- R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74:47--97, 2002.Google ScholarCross Ref
- Reka Albert, Hawoong Jeong, and Albert-Laszlo Barabasi. Error and attack tolerance of complex networks. Nature, 406:378, 2000.Google ScholarCross Ref
- D. Anthony. Social network analysis in military headquarters using cavalier. In 5th International Command, Control Research and Technology Symposium.Google Scholar
- David Bader, Shiva Kintali, Kamesh Madduri, and Milena Mihail. Approximating betweenness centrality. pages 124--137. 2007.Google Scholar
- P Bonacich. Factoring and weighting approaches to status scores and clique identification. J. Math. Social. 2, pages 113--120, 1972.Google Scholar
- Ulrik Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25:163--177, 2001.Google ScholarCross Ref
- Ulrik Brandes and Christian Pich. Centrality estimation in large networks. International Journal of Bifurcation and Chaos, pages 2303--2318, 2007.Google ScholarCross Ref
- Tim Dwyer, Seok-Hee Hong, Dirk Koschützki, Falk Schreiber, and Kai Xu. Visual analysis of network centralities. In APVis '06: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation, pages 189--197, Darlinghurst, Australia, Australia, 2006. Australian Computer Society, Inc. Google ScholarDigital Library
- David Eppstein and Joseph Wang. Fast approximation of centrality. In SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 228--229, Philadelphia, PA, USA, 2001. Society for Industrial and Applied Mathematics. Google ScholarDigital Library
- Dániel Fogaras. Where to start browsing the web. In IICS: nnovative internet community systems, pages 65--79. Springer-Verlag, 2003.Google Scholar
- Linton C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35--41, March 1977.Google ScholarCross Ref
- Linton C. Freeman. Centrality in social networks: Conceptual clarification. Social Networks, 1(3):215--239, 1979.Google ScholarCross Ref
- Robert Geisberger, Peter Sanders, and Dominik Schultes. Better approximation of betweenness centrality. In Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), 2008.Google ScholarCross Ref
- Pablo Gleiser and Leon Danon. Community structure in jazz. Advances in Complex Systems, 6:565, 2003.Google ScholarCross Ref
- Per Hage and Frank Harary. Eccentricity and centrality in networks. Social Networks, 17(1):57--63, 1995.Google ScholarCross Ref
- K. i. Goh, E. Oh, B. Kahng, and D. Kim. Betweenness centrality correlation in social networks. Phys. Rev. E, 67:01710-1, 2003.Google ScholarCross Ref
- Saroja Kanchi and David Vineyard. An optimal distributed algorithm for all-pairs shortest-path. Information theories and applications, 11:141--146, 2004.Google Scholar
- A.-M. Kermarrec, E. Le Merrer, B. Sericola, and G. Trédan. Rr-6809 inria - second order centrality: distributed assessment of nodes criticity in complex networks, 2009.Google Scholar
- V. Latora and M. Marchiori. A measure of centrality based on network efficiency. New Journal of Physics, 9(188), 2007.Google Scholar
- Jure Leskovec and Christos Faloutsos. Sampling from large graphs. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 631--636, New York, NY, USA, 2006. ACM. Google ScholarDigital Library
- Soumendra Nanda and David Kotz. Localized bridging centrality for distributed network analysis. In Proceedings of the 17th International Conference on Computer Communications and Networks (ICCCN), pages 1--6, August 2008.Google ScholarCross Ref
- Newman. A measure of betweenness centrality based on random walks. Social Networks, 27(1):39--54, January 2005.Google ScholarCross Ref
- Kazuya Okamoto, Wei Chen, and Xiang-Yang Li. Ranking of closeness centrality for large-scale social networks. In FAW '08: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics, pages 186--195, Berlin, Heidelberg, 2008. Springer-Verlag. Google ScholarDigital Library
- Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.Google Scholar
- Muhammad Akram Shaikh, Jiaxin Wang, Zehong Yang, and Yixu Song. Graph structural mining in terrorist networks. In ADMA '07: Proceedings of the 3rd international conference on Advanced Data Mining and Applications, pages 570--577, Berlin, Heidelberg, 2007. Springer-Verlag. Google ScholarDigital Library
- Jeffrey Travers and Stanley Milgram. An experimental study of the small world problem. Sociometry, 32(4):425--443, 1969.Google ScholarCross Ref
- Stanley Wasserman, Katherine Faust, and Dawn Iacobucci. Social Network Analysis: Methods and Applications (Structural Analysis in the Social Sciences). Cambridge University Press, November 1994.Google Scholar
- Eiko Yoneki, Pan Hui, ShuYan Chan, and Jon Crowcroft. A socio-aware overlay for publish/subscribe communication in delay tolerant networks. In MSWiM '07: Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems, pages 225--234, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
Index Terms
- Centralities: capturing the fuzzy notion of importance in social graphs
Recommendations
k-Centralities: local approximations of global measures based on shortest paths
WWW '12 Companion: Proceedings of the 21st International Conference on World Wide WebA lot of centrality measures have been developed to analyze different aspects of importance. Some of the most popular centrality measures (e.g. betweenness centrality, closeness centrality) are based on the calculation of shortest paths. This ...
Correlating centralities of social networks
2016 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)Centrality is an important measure to identify the most important actors in a network. This paper discusses the various Centrality Measures used in Social Network Analysis. These measures are tested on complex real-world social network data sets such as ...
On eigenvector-like centralities for temporal networks
Centrality measures play a central role in Complex Networks Theory as much as they provide a tool to rank nodes by their relevance in the processes occurring in a network. In this paper we propose a model for the eigenvector-like centralities of ...
Comments