A Multi-Attribute Decision-Making Approach for Critical Node Identification in Complex Networks.

IF 2 3区 物理与天体物理 Q2 PHYSICS, MULTIDISCIPLINARY Entropy Pub Date : 2024-12-09 DOI:10.3390/e26121075
Xinyun Zhao, Yongheng Zhang, Qingying Zhai, Jinrui Zhang, Lanlan Qi
{"title":"A Multi-Attribute Decision-Making Approach for Critical Node Identification in Complex Networks.","authors":"Xinyun Zhao, Yongheng Zhang, Qingying Zhai, Jinrui Zhang, Lanlan Qi","doi":"10.3390/e26121075","DOIUrl":null,"url":null,"abstract":"<p><p>Correctly identifying influential nodes in a complex network and implementing targeted protection measures can significantly enhance the overall security of the network. Currently, indicators such as degree centrality, closeness centrality, betweenness centrality, H-index, and K-shell are commonly used to measure node influence. Although these indicators can identify critical nodes to some extent, they often consider node attributes from a narrow perspective and have certain limitations. Therefore, evaluating the importance of nodes using most existing indicators remains incomplete. In this paper, we propose the multi-attribute CRITIC-TOPSIS network decision indicator, or MCTNDI, which integrates closeness centrality, betweenness centrality, H-index, and network constraint coefficients to identify critical nodes in a network. This indicator combines information from multiple perspectives, including local neighborhood importance, network topological location, path centrality, and node mutual information, thereby solving the issue of the one-sided perspective of single indicators and providing a more comprehensive measure of node importance. Additionally, MCTNDI is validated through the analysis of several real-world networks, including the Contiguous USA network, Dolphins network, USAir97 network, and Tech-routers-rf network. The validation is conducted from four aspects: the results of simulated network attacks, the distribution of node importance, the monotonicity of rankings, and the similarity of indicators, illustrating MCTNDI's effectiveness in real networks.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"26 12","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11675182/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Entropy","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.3390/e26121075","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

Correctly identifying influential nodes in a complex network and implementing targeted protection measures can significantly enhance the overall security of the network. Currently, indicators such as degree centrality, closeness centrality, betweenness centrality, H-index, and K-shell are commonly used to measure node influence. Although these indicators can identify critical nodes to some extent, they often consider node attributes from a narrow perspective and have certain limitations. Therefore, evaluating the importance of nodes using most existing indicators remains incomplete. In this paper, we propose the multi-attribute CRITIC-TOPSIS network decision indicator, or MCTNDI, which integrates closeness centrality, betweenness centrality, H-index, and network constraint coefficients to identify critical nodes in a network. This indicator combines information from multiple perspectives, including local neighborhood importance, network topological location, path centrality, and node mutual information, thereby solving the issue of the one-sided perspective of single indicators and providing a more comprehensive measure of node importance. Additionally, MCTNDI is validated through the analysis of several real-world networks, including the Contiguous USA network, Dolphins network, USAir97 network, and Tech-routers-rf network. The validation is conducted from four aspects: the results of simulated network attacks, the distribution of node importance, the monotonicity of rankings, and the similarity of indicators, illustrating MCTNDI's effectiveness in real networks.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
复杂网络中关键节点识别的多属性决策方法。
正确识别复杂网络中有影响的节点,并采取有针对性的保护措施,可以显著提升网络的整体安全性。目前常用度中心性、接近中心性、中间度中心性、h指数、k壳等指标来衡量节点影响。这些指标虽然能在一定程度上识别关键节点,但往往从狭隘的角度考虑节点属性,存在一定的局限性。因此,使用大多数现有指标评估节点的重要性仍然是不完整的。在本文中,我们提出了多属性critical - topsis网络决策指标(MCTNDI),该指标综合了接近性中心性、中间性中心性、h指数和网络约束系数来识别网络中的关键节点。该指标综合了局部邻域重要性、网络拓扑位置、路径中心性、节点互信息等多个角度的信息,解决了单一指标片面的问题,提供了更全面的节点重要性度量。此外,MCTNDI还通过对几个实际网络的分析进行了验证,包括美国连续网络、海豚网络、USAir97网络和Tech-routers-rf网络。从模拟网络攻击结果、节点重要性分布、排名单调性和指标相似性四个方面进行验证,说明了MCTNDI在真实网络中的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Entropy
Entropy PHYSICS, MULTIDISCIPLINARY-
CiteScore
4.90
自引率
11.10%
发文量
1580
审稿时长
21.05 days
期刊介绍: Entropy (ISSN 1099-4300), an international and interdisciplinary journal of entropy and information studies, publishes reviews, regular research papers and short notes. Our aim is to encourage scientists to publish as much as possible their theoretical and experimental details. There is no restriction on the length of the papers. If there are computation and the experiment, the details must be provided so that the results can be reproduced.
期刊最新文献
The Scaled Hirshfeld Partitioning: Mathematical Development and Information-Theoretic Foundation. Spectral Signatures of Prime Factorization. Managing Uncertainty and Information Dynamics with Graphics-Enhanced TOGAF Architecture in Higher Education. Additomultiplicative Cascades Govern Multifractal Scaling Reliability Across Cardiac, Financial, and Climate Systems. Mining the Collaborative Networks: A Machine Learning-Based Approach to Firm Innovation in the Digital Transformation Era.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1