IDEAS home Printed from https://ideas.repec.org/a/spr/scient/v129y2024i11d10.1007_s11192-024-05170-5.html
   My bibliography  Save this article

H-core decomposition for directed networks and its application

Author

Listed:
  • Xiaoyu Chen

    (Shaanxi Normal University
    Zhejiang Normal University)

  • Yang Liu

    (Zhejiang Normal University
    Yili Normal University)

  • Zhenxin Cao

    (Zhejiang Normal University)

  • Xiaopeng Li

    (Northwest A&F University)

  • Jinde Cao

    (Southeast University
    Ahlia University)

Abstract

In this paper, we introduce a directed weighted h-index and a bi-directional h-core decomposition for directed networks, aimed at better identifying important nodes and dense subgraphs. This directed weighted h-index combines the edges’ direction and weight in a directed network, and it can effectively measure the centrality of nodes. To obtain the h-core, we design an iterative algorithm, and we develop a bi-directional h-core decomposition method for partitioning the nodes in a network. As an application, we apply the directed weighted h-index and algorithm to the CEL neural network, USAir network and Social network to identify dense subgraphs and important nodes. Comparative analysis with existing h-type indices demonstrates that our proposed directed weighted h-index is a superior measure of centrality in terms of its ability to identify important nodes and dense subgraphs more accurately.

Suggested Citation

  • Xiaoyu Chen & Yang Liu & Zhenxin Cao & Xiaopeng Li & Jinde Cao, 2024. "H-core decomposition for directed networks and its application," Scientometrics, Springer;Akadémiai Kiadó, vol. 129(11), pages 6571-6596, November.
  • Handle: RePEc:spr:scient:v:129:y:2024:i:11:d:10.1007_s11192-024-05170-5
    DOI: 10.1007/s11192-024-05170-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11192-024-05170-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11192-024-05170-5?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.

    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:spr:scient:v:129:y:2024:i:11:d:10.1007_s11192-024-05170-5. 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.springer.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.