Skip to main content
×
Home
    • Aa
    • Aa

Rank monotonicity in centrality measures

  • PAOLO BOLDI (a1), ALESSANDRO LUONGO (a1) and SEBASTIANO VIGNA (a1)
Abstract
Abstract

A measure of centrality is rank monotone if after adding an arc xy, all nodes with a score smaller than (or equal to) y have still a score smaller than (or equal to) y. If, in particular, all nodes with a score smaller than or equal to y get a score smaller than y (i.e., all ties with y are broken in favor of y), the measure is called strictly rank monotone. We prove that harmonic centrality is strictly rank monotone, whereas closeness is just rank monotone on strongly connected graphs, and that some other measures, including betweenness, are not rank monotone at all (sometimes not even on strongly connected graphs). Among spectral measures, damped scores such as Katz's index and PageRank are strictly rank monotone on all graphs, whereas the dominant eigenvector is strictly monotone on strongly connected graphs only.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Network Science
  • ISSN: 2050-1242
  • EISSN: 2050-1250
  • URL: /core/journals/network-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 10 *
Loading metrics...

Abstract views

Total abstract views: 176 *
Loading metrics...

* Views captured on Cambridge Core between 26th July 2017 - 19th September 2017. This data will be updated every 24 hours.