IDEAS home Printed from https://ideas.repec.org/a/taf/gmasxx/v45y2021i4p195-222.html
   My bibliography  Save this article

Convex combinations of centrality measures

Author

Listed:
  • Ying Ying Keng
  • Kiam Heong Kwa
  • Christopher McClain

Abstract

Despite a plethora of centrality measures were proposed, there is no consensus on what centrality is exactly due to the shortcomings each measure has. In this manuscript, we propose to combine centrality measures pertinent to a network by forming their convex combinations. We found that some combinations, induced by regular points, split the nodes into the largest number of classes by their rankings. Moreover, regular points are found with probability $$1$$1 and their induced rankings are insensitive to small variation. By contrast, combinations induced by critical points are scarce, but their presence enables the variation in node rankings. We also discuss how optimum combinations could be chosen, while proving various properties of the convex combinations of centrality measures.

Suggested Citation

  • Ying Ying Keng & Kiam Heong Kwa & Christopher McClain, 2021. "Convex combinations of centrality measures," The Journal of Mathematical Sociology, Taylor & Francis Journals, vol. 45(4), pages 195-222, October.
    • Handle: RePEc:taf:gmasxx:v:45:y:2021:i:4:p:195-222
    DOI: 10.1080/0022250X.2020.1765776
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0022250X.2020.1765776
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0022250X.2020.1765776?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.

    More about this item

    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:taf:gmasxx:v:45:y:2021:i:4:p:195-222. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/gmas .

    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.