Convex combinations of centrality measures

Ying Ying Keng, Kiam Heong Kwa and Christopher McClain

The Journal of Mathematical Sociology, 2021, vol. 45, issue 4, 195-222

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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/0022250X.2020.1765776 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:gmasxx:v:45:y:2021:i:4:p:195-222

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/gmas20

DOI: 10.1080/0022250X.2020.1765776

Access Statistics for this article

The Journal of Mathematical Sociology is currently edited by Noah Friedkin

More articles in The Journal of Mathematical Sociology from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().