IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8928765.html
   My bibliography  Save this article

Identifying Key Nodes in Complex Networks Based on Local Structural Entropy and Clustering Coefficient

Author

Listed:
  • Peng Li
  • Shilin Wang
  • Guangwu Chen
  • Chengqi Bao
  • Guanghui Yan
  • Yuxing Li

Abstract

Key nodes have a significant impact, both structural and functional, on complex networks. Commonly used methods for measuring the importance of nodes in complex networks are those using degree centrality, clustering coefficient, etc. Despite a wide range of application due to their simplicity, their limitations cannot be ignored. The methods based on degree centrality use only first-order relations of nodes, and the methods based on the clustering coefficient use the closeness of the neighbors of nodes while ignore the scale of numbers of neighbors. Local structural entropy, by replacing the node influence on networks with local structural influence, increases the identifying effect, but has a low accuracy in the case of high clustered networks. To identify key nodes in complex networks, a novel method, which considers both the influence and the closeness of neighbors and is based on local structural entropy and clustering coefficient, is proposed in this paper. The proposed method considers not only the information of the node itself, but also its neighbors. The simplicity and accuracy of measurement improve the significance of characterizing the reliability and destructiveness of large-scale networks. Demonstrations on constructed networks and real networks show that the proposed method outperforms other related approaches.

Suggested Citation

  • Peng Li & Shilin Wang & Guangwu Chen & Chengqi Bao & Guanghui Yan & Yuxing Li, 2022. "Identifying Key Nodes in Complex Networks Based on Local Structural Entropy and Clustering Coefficient," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-11, August.
  • Handle: RePEc:hin:jnlmpe:8928765
    DOI: 10.1155/2022/8928765
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/8928765.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/8928765.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/8928765?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:hin:jnlmpe:8928765. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.