Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/82257
Title: Critical nodes identification in complex networks
Authors: Yang, H 
An, S
Issue Date: 2020
Source: Symmetry, Jan. 2020, v. 12, no. 1, 123, p. 1-14
Abstract: Critical nodes identification in complex networks is significance for studying the survivability and robustness of networks. The previous studies on structural hole theory uncovered that structural holes are gaps between a group of indirectly connected nodes and intermediaries that fill the holes and serve as brokers for information exchange. In this paper, we leverage the property of structural hole to design a heuristic algorithm based on local information of the network topology to identify node importance in undirected and unweighted network, whose adjacency matrix is symmetric. In the algorithm, a node with a larger degree and greater number of structural holes associated with it, achieves a higher importance ranking. Six real networks are used as test data. The experimental results show that the proposed method not only has low computational complexity, but also outperforms degree centrality, k-shell method, mapping entropy centrality, the collective influence algorithm, DDN algorithm that based on node degree and their neighbors, and random ranking method in identifying node importance for network connectivity in complex networks.
Keywords: Network disintegration
Network connectivity
Node importance
Structure hole
Publisher: MDPI
Journal: Symmetry 
EISSN: 2073-8994
DOI: 10.3390/sym12010123
Rights: © 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
The following publication Yang, H.; An, S. Critical Nodes Identification in Complex Networks. Symmetry 2020, 12, 123 is available at https://dx.doi.org/10.3390/sym12010123
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Yang_Identification_Complex_Networks.pdf1.71 MBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record
PIRA download icon_1.1View/Download Full Text

SCOPUSTM   
Citations

1
Citations as of Aug 19, 2020

Page view(s)

9
Citations as of Oct 18, 2020

Download(s)

5
Citations as of Oct 18, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.