根据局部和全局结构识别复杂网络中具有影响力的传播者

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Computational Science Pub Date : 2024-07-29 DOI:10.1016/j.jocs.2024.102395
{"title":"根据局部和全局结构识别复杂网络中具有影响力的传播者","authors":"","doi":"10.1016/j.jocs.2024.102395","DOIUrl":null,"url":null,"abstract":"<div><p>Complex systems intricately intertwine with life, and the identification of the most influential spreaders in complex networks can aid in resolving numerous pragmatic problems. Nevertheless, the identification of such kinds of nodes currently stands as an open and challenging issue. In order to accurately and efficiently address this issue, numerous metrics have been proposed. In this paper, we propose a new method based on degree, clustering coefficient and k-shell decomposition value—<span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span> to detect the most influential spreaders by gauging the spreading ability of nodes. The proposed centrality assesses the significance of a node by the impacts of its neighbors, encompassing both the local and global network structures. To evaluate the performance of <span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span>, we compare it with different centrality measures under utilizing the Susceptible–Infected–Recovered model to simulate the propagation of epidemics across real-world networks. Experiments on real networks illustrate that <span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span> exhibits superior differentiation ability and more accurate identification ability for influential spreaders and compared with other methods, Kendall’s <span><math><mi>τ</mi></math></span> correlation coefficient of the <span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span> could be enhanced by 12.82%, 13.20%, 8.62%, 5.32%, 7.97% and 11.73% for the degree centrality, K-shell decomposition, <span><math><mrow><mi>G</mi><mi>L</mi><mi>I</mi></mrow></math></span> centrality, <span><math><mi>H</mi></math></span>-<span><math><mrow><mi>G</mi><mi>S</mi><mi>M</mi></mrow></math></span> centrality, <span><math><mrow><mi>L</mi><mi>G</mi><mi>I</mi></mrow></math></span> centrality and <span><math><mrow><mi>N</mi><mi>P</mi><mi>C</mi><mi>C</mi></mrow></math></span> centrality.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1000,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Identifying influential spreaders in complex networks based on local and global structure\",\"authors\":\"\",\"doi\":\"10.1016/j.jocs.2024.102395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Complex systems intricately intertwine with life, and the identification of the most influential spreaders in complex networks can aid in resolving numerous pragmatic problems. Nevertheless, the identification of such kinds of nodes currently stands as an open and challenging issue. In order to accurately and efficiently address this issue, numerous metrics have been proposed. In this paper, we propose a new method based on degree, clustering coefficient and k-shell decomposition value—<span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span> to detect the most influential spreaders by gauging the spreading ability of nodes. The proposed centrality assesses the significance of a node by the impacts of its neighbors, encompassing both the local and global network structures. To evaluate the performance of <span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span>, we compare it with different centrality measures under utilizing the Susceptible–Infected–Recovered model to simulate the propagation of epidemics across real-world networks. Experiments on real networks illustrate that <span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span> exhibits superior differentiation ability and more accurate identification ability for influential spreaders and compared with other methods, Kendall’s <span><math><mi>τ</mi></math></span> correlation coefficient of the <span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span> could be enhanced by 12.82%, 13.20%, 8.62%, 5.32%, 7.97% and 11.73% for the degree centrality, K-shell decomposition, <span><math><mrow><mi>G</mi><mi>L</mi><mi>I</mi></mrow></math></span> centrality, <span><math><mi>H</mi></math></span>-<span><math><mrow><mi>G</mi><mi>S</mi><mi>M</mi></mrow></math></span> centrality, <span><math><mrow><mi>L</mi><mi>G</mi><mi>I</mi></mrow></math></span> centrality and <span><math><mrow><mi>N</mi><mi>P</mi><mi>C</mi><mi>C</mi></mrow></math></span> centrality.</p></div>\",\"PeriodicalId\":48907,\"journal\":{\"name\":\"Journal of Computational Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2024-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1877750324001881\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1877750324001881","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

复杂系统与生活错综复杂地交织在一起,识别复杂网络中最具影响力的传播者有助于解决许多实际问题。然而,如何识别这类节点目前还是一个具有挑战性的开放性问题。为了准确有效地解决这一问题,人们提出了许多衡量标准。本文提出了一种基于度、聚类系数和 K 壳分解值的新方法,通过衡量节点的传播能力来检测最具影响力的传播者。所提出的中心度通过节点邻居的影响来评估节点的重要性,包括本地和全球网络结构。为了评估 "中心度 "的性能,我们利用 "易感-感染-恢复 "模型模拟了流行病在真实世界网络中的传播,并将其与不同的中心度测量方法进行了比较。在真实网络上的实验表明,与其他方法相比,"度中心性"、"K 壳分解"、"中心性"、"- 中心性"、"中心性 "和 "中心性 "的 Kendall 相关系数分别提高了 12.82%、13.20%、8.62%、5.32%、7.97% 和 11.73%,显示出卓越的区分能力和对有影响力的传播者更准确的识别能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Identifying influential spreaders in complex networks based on local and global structure

Complex systems intricately intertwine with life, and the identification of the most influential spreaders in complex networks can aid in resolving numerous pragmatic problems. Nevertheless, the identification of such kinds of nodes currently stands as an open and challenging issue. In order to accurately and efficiently address this issue, numerous metrics have been proposed. In this paper, we propose a new method based on degree, clustering coefficient and k-shell decomposition value—DCK to detect the most influential spreaders by gauging the spreading ability of nodes. The proposed centrality assesses the significance of a node by the impacts of its neighbors, encompassing both the local and global network structures. To evaluate the performance of DCK, we compare it with different centrality measures under utilizing the Susceptible–Infected–Recovered model to simulate the propagation of epidemics across real-world networks. Experiments on real networks illustrate that DCK exhibits superior differentiation ability and more accurate identification ability for influential spreaders and compared with other methods, Kendall’s τ correlation coefficient of the DCK could be enhanced by 12.82%, 13.20%, 8.62%, 5.32%, 7.97% and 11.73% for the degree centrality, K-shell decomposition, GLI centrality, H-GSM centrality, LGI centrality and NPCC centrality.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Computational Science
Journal of Computational Science COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
5.50
自引率
3.00%
发文量
227
审稿时长
41 days
期刊介绍: Computational Science is a rapidly growing multi- and interdisciplinary field that uses advanced computing and data analysis to understand and solve complex problems. It has reached a level of predictive capability that now firmly complements the traditional pillars of experimentation and theory. The recent advances in experimental techniques such as detectors, on-line sensor networks and high-resolution imaging techniques, have opened up new windows into physical and biological processes at many levels of detail. The resulting data explosion allows for detailed data driven modeling and simulation. This new discipline in science combines computational thinking, modern computational methods, devices and collateral technologies to address problems far beyond the scope of traditional numerical methods. Computational science typically unifies three distinct elements: • Modeling, Algorithms and Simulations (e.g. numerical and non-numerical, discrete and continuous); • Software developed to solve science (e.g., biological, physical, and social), engineering, medicine, and humanities problems; • Computer and information science that develops and optimizes the advanced system hardware, software, networking, and data management components (e.g. problem solving environments).
期刊最新文献
AFF-BPL: An adaptive feature fusion technique for the diagnosis of autism spectrum disorder using Bat-PSO-LSTM based framework Data-driven robust optimization in the face of large-scale datasets: An incremental learning approach VEGF-ERCNN: A deep learning-based model for prediction of vascular endothelial growth factor using ensemble residual CNN A new space–time localized meshless method based on coupling radial and polynomial basis functions for solving singularly perturbed nonlinear Burgers’ equation Implementation of the emulator-based component analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1