Efficient Algorithm for the Identification of Node Significance in Complex Network
Identifying vital nodes is a significant issue for the study of network robustness, epidemic controlling and targeted destruction of networks. Previous studies on weak ties theory recovered that ties with weak strength usually act as the important bridges that connect different clusters and play imp...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8985345/ |
id |
doaj-3bf9e625a3bf4d469b14b7caca178c77 |
---|---|
record_format |
Article |
spelling |
doaj-3bf9e625a3bf4d469b14b7caca178c772021-03-30T02:04:08ZengIEEEIEEE Access2169-35362020-01-018289472895510.1109/ACCESS.2020.29721078985345Efficient Algorithm for the Identification of Node Significance in Complex NetworkYirun Ruan0https://orcid.org/0000-0002-4636-5713Jun Tang1https://orcid.org/0000-0001-8925-2367Yanli Hu2https://orcid.org/0000-0003-2577-4195Haoran Wang3https://orcid.org/0000-0002-2194-9421Liang Bai4https://orcid.org/0000-0002-2696-5885College of Systems Engineering, National University of Defense Technology, Changsha, ChinaCollege of Systems Engineering, National University of Defense Technology, Changsha, ChinaCollege of Systems Engineering, National University of Defense Technology, Changsha, ChinaCollege of Systems Engineering, National University of Defense Technology, Changsha, ChinaCollege of Systems Engineering, National University of Defense Technology, Changsha, ChinaIdentifying vital nodes is a significant issue for the study of network robustness, epidemic controlling and targeted destruction of networks. Previous studies on weak ties theory recovered that ties with weak strength usually act as the important bridges that connect different clusters and play important role in maintaining the network connectivity. In this paper, we quantify the strength of links based on local information of the network topology, and design a simple yet effective method to evaluate nodes' importance in terms of the number of their connections and overlap of their neighbors. Experimental analyses on synthetic and real networks demonstrate that the proposed algorithm identifies vital nodes leading to faster network collapse in target destruction than some well-known methods.https://ieeexplore.ieee.org/document/8985345/Complex networknode importanceweak tiesnetwork connectivitytarget destruction |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Yirun Ruan Jun Tang Yanli Hu Haoran Wang Liang Bai |
spellingShingle |
Yirun Ruan Jun Tang Yanli Hu Haoran Wang Liang Bai Efficient Algorithm for the Identification of Node Significance in Complex Network IEEE Access Complex network node importance weak ties network connectivity target destruction |
author_facet |
Yirun Ruan Jun Tang Yanli Hu Haoran Wang Liang Bai |
author_sort |
Yirun Ruan |
title |
Efficient Algorithm for the Identification of Node Significance in Complex Network |
title_short |
Efficient Algorithm for the Identification of Node Significance in Complex Network |
title_full |
Efficient Algorithm for the Identification of Node Significance in Complex Network |
title_fullStr |
Efficient Algorithm for the Identification of Node Significance in Complex Network |
title_full_unstemmed |
Efficient Algorithm for the Identification of Node Significance in Complex Network |
title_sort |
efficient algorithm for the identification of node significance in complex network |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2020-01-01 |
description |
Identifying vital nodes is a significant issue for the study of network robustness, epidemic controlling and targeted destruction of networks. Previous studies on weak ties theory recovered that ties with weak strength usually act as the important bridges that connect different clusters and play important role in maintaining the network connectivity. In this paper, we quantify the strength of links based on local information of the network topology, and design a simple yet effective method to evaluate nodes' importance in terms of the number of their connections and overlap of their neighbors. Experimental analyses on synthetic and real networks demonstrate that the proposed algorithm identifies vital nodes leading to faster network collapse in target destruction than some well-known methods. |
topic |
Complex network node importance weak ties network connectivity target destruction |
url |
https://ieeexplore.ieee.org/document/8985345/ |
work_keys_str_mv |
AT yirunruan efficientalgorithmfortheidentificationofnodesignificanceincomplexnetwork AT juntang efficientalgorithmfortheidentificationofnodesignificanceincomplexnetwork AT yanlihu efficientalgorithmfortheidentificationofnodesignificanceincomplexnetwork AT haoranwang efficientalgorithmfortheidentificationofnodesignificanceincomplexnetwork AT liangbai efficientalgorithmfortheidentificationofnodesignificanceincomplexnetwork |
_version_ |
1724185826303148032 |