IDEAS home Printed from https://ideas.repec.org/a/cup/netsci/v5y2017i04p529-550_00.html
   My bibliography  Save this article

Rank monotonicity in centrality measures

Author

Listed:
  • BOLDI, PAOLO
  • LUONGO, ALESSANDRO
  • VIGNA, SEBASTIANO

Abstract

A measure of centrality is rank monotone if after adding an arc x → y, 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.

Suggested Citation

  • Boldi, Paolo & Luongo, Alessandro & Vigna, Sebastiano, 2017. "Rank monotonicity in centrality measures," Network Science, Cambridge University Press, vol. 5(4), pages 529-550, December.
    • Handle: RePEc:cup:netsci:v:5:y:2017:i:04:p:529-550_00
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S2050124217000212/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    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:cup:netsci:v:5:y:2017:i:04:p:529-550_00. 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: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/nws .

    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.