IDEAS home Printed from https://ideas.repec.org/a/spr/binfse/v2y2010i6p371-385.html
   My bibliography  Save this article

A Critical Review of Centrality Measures in Social Networks

Author

Listed:
  • Andrea Landherr
  • Bettina Friedl
  • Julia Heidemann

Abstract

Social networks are currently gaining increasing impact in the light of the ongoing growth of web-based services like facebook.com. One major challenge for the economically successful implementation of selected management activities such as viral marketing is the identification of key persons with an outstanding structural position within the network. For this purpose, social network analysis provides a lot of measures for quantifying a member’s interconnectedness within social networks. In this context, our paper shows the state of the art with regard to centrality measures for social networks. Due to strongly differing results with respect to the quality of different centrality measures, this paper also aims at illustrating the tremendous importance of a reflected utilization of existing centrality measures. For this purpose, the paper analyzes five centrality measures commonly discussed in literature on the basis of three simple requirements for the behavior of centrality measures. Copyright Gabler Verlag 2010

Suggested Citation

  • Andrea Landherr & Bettina Friedl & Julia Heidemann, 2010. "A Critical Review of Centrality Measures in Social Networks," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 2(6), pages 371-385, December.
    • Handle: RePEc:spr:binfse:v:2:y:2010:i:6:p:371-385
    DOI: 10.1007/s12599-010-0127-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s12599-010-0127-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s12599-010-0127-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    2. S. Lee & S.-H. Yook & Y. Kim, 2009. "Centrality measure of complex networks using biased random walks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 68(2), pages 277-281, March.
    3. Terrill L. Frantz & Marcelo Cataldo & Kathleen M. Carley, 2009. "Robustness of centrality measures under uncertainty: Examining the role of network topology," Computational and Mathematical Organization Theory, Springer, vol. 15(4), pages 303-328, December.
    4. Kristine de Valck & Gerrit H. van Bruggen & Berendt Wierenga, 2009. "Virtual communities: A marketing perspective," Post-Print hal-00458421, HAL.
    5. Ronald Rousseau & Lin Zhang, 2008. "Betweenness centrality and Q-measures in directed valued networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 75(3), pages 575-590, June.
    6. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    7. Stephen P. Borgatti, 2006. "Identifying sets of key players in a social network," Computational and Mathematical Organization Theory, Springer, vol. 12(1), pages 21-34, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Li, Yongli & Wu, Chong & Wang, Xiaoyu & Luo, Peng, 2014. "A network-based and multi-parameter model for finding influential authors," Journal of Informetrics, Elsevier, vol. 8(3), pages 791-799.
    2. Zhao, Shuying & Sun, Shaowei, 2023. "Identification of node centrality based on Laplacian energy of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    3. Wu, Tao & Xian, Xingping & Zhong, Linfeng & Xiong, Xi & Stanley, H. Eugene, 2018. "Power iteration ranking via hybrid diffusion for vital nodes identification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 802-815.
    4. Michel Grabisch & Agnieszka Rusinowska, 2015. "Lattices in Social Networks with Influence," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 17(01), pages 1-18.
    5. Wang, Feifei & Sun, Zejun & Gan, Quan & Fan, Aiwan & Shi, Hesheng & Hu, Haifeng, 2022. "Influential node identification by aggregating local structure information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 593(C).
    6. van den Brink, René & Rusinowska, Agnieszka, 2022. "The degree measure as utility function over positions in graphs and digraphs," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1033-1044.
    7. Mahyar, Hamidreza & Hasheminezhad, Rouzbeh & Ghalebi K., Elahe & Nazemian, Ali & Grosu, Radu & Movaghar, Ali & Rabiee, Hamid R., 2018. "Compressive sensing of high betweenness centrality nodes in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 497(C), pages 166-184.
    8. Umed Temurshoev, 2008. "Who's Who in Networks. Wanted: the Key Group," Working Papers 08-08, NET Institute, revised Sep 2008.
    9. Lindquist, Matthew J. & Zenou, Yves, 2019. "Crime and Networks: 10 Policy Lessons," IZA Discussion Papers 12534, Institute of Labor Economics (IZA).
    10. Yu, Senbin & Gao, Liang & Xu, Lida & Gao, Zi-You, 2019. "Identifying influential spreaders based on indirect spreading in neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 418-425.
    11. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    12. repec:hal:pseose:halshs-00977005 is not listed on IDEAS
    13. László Csató, 2017. "Measuring centrality by a generalization of degree," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 771-790, December.
    14. René van den Brink & Agnieszka Rusinowska, 2017. "The degree measure as utility function over positions in networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01592181, HAL.
    15. Wang, Yuhong & Cullinane, Kevin, 2016. "Determinants of port centrality in maritime container transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 326-340.
    16. Gao, Shuai & Ma, Jun & Chen, Zhumin & Wang, Guanghui & Xing, Changming, 2014. "Ranking the spreading ability of nodes in complex networks based on local structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 403(C), pages 130-147.
    17. Xie, Zheng & Lv, Yiqin & Song, Yiping & Wang, Qi, 2024. "Data labeling through the centralities of co-reference networks improves the classification accuracy of scientific papers," Journal of Informetrics, Elsevier, vol. 18(2).
    18. Koster, Maurice & Lindner, Ines & Molina, Elisenda, 2010. "Networks and collective action," DES - Working Papers. Statistics and Econometrics. WS ws104830, Universidad Carlos III de Madrid. Departamento de Estadística.
    19. Huang, Wencheng & Li, Haoran & Yin, Yanhui & Zhang, Zhi & Xie, Anhao & Zhang, Yin & Cheng, Guo, 2024. "Node importance identification of unweighted urban rail transit network: An Adjacency Information Entropy based approach," Reliability Engineering and System Safety, Elsevier, vol. 242(C).
    20. Xu, Xiao-Ke & Wang, Xue & Xiao, Jing, 2018. "Inferring parent–child relationships by a node-remove centrality framework in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 505(C), pages 222-232.
    21. Miriam Däs & Julia Klier & Mathias Klier & Georg Lindner & Lea Thiel, 2017. "Customer lifetime network value: customer valuation in the context of network effects," Electronic Markets, Springer;IIM University of St. Gallen, vol. 27(4), pages 307-328, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:binfse:v:2:y:2010:i:6:p:371-385. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.