IDEAS home Printed from https://ideas.repec.org/a/nat/natcom/v7y2016i1d10.1038_ncomms10168.html
   My bibliography  Save this article

The H-index of a network node and its relation to degree and coreness

Author

Listed:
  • Linyuan Lü

    (Alibaba Research Center for Complexity Sciences, Alibaba Business College, Hangzhou Normal University)

  • Tao Zhou

    (CompleX Lab, Web Sciences Center, University of Electronic Science and Technology of China
    Big Data Research Center, Univesrsity of Electronic Science and Technology of China)

  • Qian-Ming Zhang

    (CompleX Lab, Web Sciences Center, University of Electronic Science and Technology of China
    Boston University)

  • H. Eugene Stanley

    (Alibaba Research Center for Complexity Sciences, Alibaba Business College, Hangzhou Normal University
    Boston University)

Abstract

Identifying influential nodes in dynamical processes is crucial in understanding network structure and function. Degree, H-index and coreness are widely used metrics, but previously treated as unrelated. Here we show their relation by constructing an operator , in terms of which degree, H-index and coreness are the initial, intermediate and steady states of the sequences, respectively. We obtain a family of H-indices that can be used to measure a node’s importance. We also prove that the convergence to coreness can be guaranteed even under an asynchronous updating process, allowing a decentralized local method of calculating a node’s coreness in large-scale evolving networks. Numerical analyses of the susceptible-infected-removed spreading dynamics on disparate real networks suggest that the H-index is a good tradeoff that in many cases can better quantify node influence than either degree or coreness.

Suggested Citation

  • Linyuan Lü & Tao Zhou & Qian-Ming Zhang & H. Eugene Stanley, 2016. "The H-index of a network node and its relation to degree and coreness," Nature Communications, Nature, vol. 7(1), pages 1-7, April.
  • Handle: RePEc:nat:natcom:v:7:y:2016:i:1:d:10.1038_ncomms10168
    DOI: 10.1038/ncomms10168
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/ncomms10168
    File Function: Abstract
    Download Restriction: no

    File URL: https://libkey.io/10.1038/ncomms10168?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
    ---><---

    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:nat:natcom:v:7:y:2016:i:1:d:10.1038_ncomms10168. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.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.