Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v25y2017i4d10.1007_s10100-016-0439-6.html
   My bibliography  Save this article

Measuring centrality by a generalization of degree

Author

Listed:
  • László Csató

    (Corvinus University of Budapest
    MTA-BCE “Lendület” Strategic Interactions Research Group)

Abstract

Network analysis has emerged as a key technique in communication studies, economics, geography, history and sociology, among others. A fundamental issue is how to identify key nodes, for which purpose a number of centrality measures have been developed. This paper proposes a new parametric family of centrality measures called generalized degree. It is based on the idea that a relationship to a more interconnected node contributes to centrality in a greater extent than a connection to a less central one. Generalized degree improves on degree by redistributing its sum over the network with the consideration of the global structure. Application of the measure is supported by a set of basic properties. A sufficient condition is given for generalized degree to be rank monotonic, excluding counter-intuitive changes in the centrality ranking after certain modifications of the network. The measure has a graph interpretation and can be calculated iteratively. Generalized degree is recommended to apply besides degree since it preserves most favourable attributes of degree, but better reflects the role of the nodes in the network and has an increased ability to distinguish among their importance.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:cejnor:v:25:y:2017:i:4:d:10.1007_s10100-016-0439-6
    DOI: 10.1007/s10100-016-0439-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-016-0439-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10100-016-0439-6?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 look for a different version below or search for a different version of it.

    Other versions of this item:

    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. Lindelauf, R.H.A. & Hamers, H.J.M. & Husslage, B.G.M., 2013. "Cooperative game theoretic centrality analysis of terrorist networks: The cases of Jemaah Islamiyah and Al Qaeda," European Journal of Operational Research, Elsevier, vol. 229(1), pages 230-238.
    3. Mitri Kitti, 2012. "Axioms for Centrality Scoring with Principal Eigenvectors," Discussion Papers 79, Aboa Centre for Economics.
    4. Zenou, Yves & ,, 2014. "Local and Consistent Centrality Measures in Networks," CEPR Discussion Papers 10031, C.E.P.R. Discussion Papers.
    5. Chebotarev, P. Yu., 1994. "Aggregation of preferences by the generalized row sum method," Mathematical Social Sciences, Elsevier, vol. 27(3), pages 293-320, June.
    6. László Csató, 2015. "A graph interpretation of the least squares ranking method," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(1), pages 51-69, January.
    7. Herman Monsuur & Ton Storcken, 2004. "Centers in Connected Undirected Graphs: An Axiomatic Approach," Operations Research, INFORMS, vol. 52(1), pages 54-64, February.
    8. Julio González-Díaz & Ruud Hendrickx & Edwin Lohmann, 2014. "Paired comparisons analysis: an axiomatic approach to ranking methods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(1), pages 139-169, January.
    9. 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.
    10. Ranjan, Gyan & Zhang, Zhi-Li, 2013. "Geometry of complex networks and topological centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(17), pages 3833-3845.
    11. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ausloos, Marcel, 2024. "Hierarchy selection: New team ranking indicators for cyclist multi-stage races," European Journal of Operational Research, Elsevier, vol. 314(2), pages 807-816.
    2. Marijana Zekić-Sušac & Rudolf Scitovski & Goran Lešaja, 2018. "CEJOR special issue of Croatian Operational Research Society," 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. 26(3), pages 531-534, September.
    3. Tibor Csendes & Csanád Imreh & József Temesi, 2017. "Editorial," 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 739-741, December.

    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. Csató, László & Tóth, Csaba, 2020. "University rankings from the revealed preferences of the applicants," European Journal of Operational Research, Elsevier, vol. 286(1), pages 309-320.
    2. L'aszl'o Csat'o & Csaba T'oth, 2018. "University rankings from the revealed preferences of the applicants," Papers 1810.04087, arXiv.org, revised Feb 2020.
    3. László Csató, 2019. "An impossibility theorem for paired comparisons," 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. 27(2), pages 497-514, June.
    4. 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.
    5. Hannu Salonen, 2016. "Equilibria and centrality in link formation games," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(4), pages 1133-1151, November.
    6. László Csató, 2017. "On the ranking of a Swiss system chess team tournament," Annals of Operations Research, Springer, vol. 254(1), pages 17-36, July.
    7. Zenou, Yves, 2014. "Key Players," CEPR Discussion Papers 10277, C.E.P.R. Discussion Papers.
    8. 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.
    9. 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).
    10. Verdier, Thierry & Zenou, Yves, 2017. "The role of social networks in cultural assimilation," Journal of Urban Economics, Elsevier, vol. 97(C), pages 15-39.
    11. Francis Bloch & Matthew O. Jackson & Pietro Tebaldi, 2023. "Centrality measures in networks," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 61(2), pages 413-453, August.
    12. 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.
    13. Umed Temurshoev, 2008. "Who's Who in Networks. Wanted: the Key Group," Working Papers 08-08, NET Institute, revised Sep 2008.
    14. Hahn, Youjin & Islam, Asadul & Patacchini, Eleonora & Zenou, Yves, 2015. "Network Structure and Education Outcomes: Evidence from a Field Experiment in Bangladesh," IZA Discussion Papers 8872, Institute of Labor Economics (IZA).
    15. 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.
    16. 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.
    17. Matthew Elliott & Benjamin Golub, 2019. "A Network Approach to Public Goods," Journal of Political Economy, University of Chicago Press, vol. 127(2), pages 730-776.
    18. Csató, László, 2017. "European qualifiers to the 2018 FIFA World Cup can be manipulated," MPRA Paper 82652, University Library of Munich, Germany.
    19. Hannu Salonen, 2015. "Bonacich Measures as Equilibria in Network Models," Discussion Papers 100, Aboa Centre for Economics.
    20. Mehmet S. Ismail, 2024. "Performance Rating Equilibrium," Papers 2410.19006, arXiv.org, revised Oct 2024.

    More about this item

    Keywords

    Network; Centrality measure; Degree; Axiomatic approach;
    All these keywords.

    JEL classification:

    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

    Statistics

    Access and download statistics

    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:cejnor:v:25:y:2017:i:4:d:10.1007_s10100-016-0439-6. 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.