Node center identification in complex networks based on Jensen–Shannon divergence

IF 3.4 2区 数学 Q1 MATHEMATICS, APPLIED
Bowen Han, Guochen Feng, Pengjian Shang
{"title":"Node center identification in complex networks based on Jensen–Shannon divergence","authors":"Bowen Han,&nbsp;Guochen Feng,&nbsp;Pengjian Shang","doi":"10.1016/j.cnsns.2025.108977","DOIUrl":null,"url":null,"abstract":"<div><div>The evaluation of node centrality remains a critical challenge in the field of complex network research. This paper proposes a novel method, the <span><math><mrow><mi>J</mi><mi>S</mi><mi>D</mi></mrow></math></span> method, which integrates local and global information to measure node centrality. The method employs Shannon entropy to quantify local centrality and Jensen–Shannon (<span><math><mrow><mi>J</mi><mi>S</mi></mrow></math></span>) divergence to compute inter-community distances, thereby assessing topological differences between communities and measuring global centrality. Experiments conducted on both real and random networks evaluated the impact of central nodes identified by the <span><math><mrow><mi>J</mi><mi>S</mi><mi>D</mi></mrow></math></span> method on network efficiency. Simulation results demonstrate that in networks with distinct community structures, the <span><math><mrow><mi>J</mi><mi>S</mi><mi>D</mi></mrow></math></span> method provides more accurate node centrality measurements compared to the <span><math><mrow><mi>B</mi><mi>C</mi></mrow></math></span>, <span><math><mrow><mi>C</mi><mi>C</mi><mi>I</mi></mrow></math></span>, <span><math><mrow><mi>C</mi><mi>B</mi><mi>C</mi></mrow></math></span>, <span><math><mrow><mi>C</mi><mi>O</mi><mi>M</mi><mi>M</mi></mrow></math></span>, and <span><math><mrow><mi>C</mi><mi>I</mi></mrow></math></span> methods. Additionally, the repetition frequency of central ranking nodes indicates that the <span><math><mrow><mi>J</mi><mi>S</mi><mi>D</mi></mrow></math></span> method effectively distinguishes the centrality of different nodes. Finally, the paper discusses the impact of different combination methods on measurement performance, revealing that incorporating additional community information further enhances the method’s effectiveness.</div></div>","PeriodicalId":50658,"journal":{"name":"Communications in Nonlinear Science and Numerical Simulation","volume":"150 ","pages":"Article 108977"},"PeriodicalIF":3.4000,"publicationDate":"2025-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Nonlinear Science and Numerical Simulation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1007570425003880","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

The evaluation of node centrality remains a critical challenge in the field of complex network research. This paper proposes a novel method, the JSD method, which integrates local and global information to measure node centrality. The method employs Shannon entropy to quantify local centrality and Jensen–Shannon (JS) divergence to compute inter-community distances, thereby assessing topological differences between communities and measuring global centrality. Experiments conducted on both real and random networks evaluated the impact of central nodes identified by the JSD method on network efficiency. Simulation results demonstrate that in networks with distinct community structures, the JSD method provides more accurate node centrality measurements compared to the BC, CCI, CBC, COMM, and CI methods. Additionally, the repetition frequency of central ranking nodes indicates that the JSD method effectively distinguishes the centrality of different nodes. Finally, the paper discusses the impact of different combination methods on measurement performance, revealing that incorporating additional community information further enhances the method’s effectiveness.
基于Jensen-Shannon散度的复杂网络节点中心识别
节点中心性的评估一直是复杂网络研究领域的一个关键挑战。本文提出了一种新的节点中心性度量方法——JSD方法,该方法综合了局部和全局信息来度量节点中心性。该方法利用Shannon熵量化局部中心性,利用Jensen-Shannon (JS)散度计算群落间距离,从而评估群落间的拓扑差异,测量全局中心性。在真实网络和随机网络上进行的实验评估了JSD方法识别的中心节点对网络效率的影响。仿真结果表明,在具有不同社区结构的网络中,JSD方法比BC、CCI、CBC、COMM和CI方法提供了更精确的节点中心性测量。此外,中心排序节点的重复频率表明JSD方法可以有效区分不同节点的中心性。最后,本文讨论了不同组合方法对测量性能的影响,揭示了加入额外的社区信息进一步提高了方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Communications in Nonlinear Science and Numerical Simulation
Communications in Nonlinear Science and Numerical Simulation MATHEMATICS, APPLIED-MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
CiteScore
6.80
自引率
7.70%
发文量
378
审稿时长
78 days
期刊介绍: The journal publishes original research findings on experimental observation, mathematical modeling, theoretical analysis and numerical simulation, for more accurate description, better prediction or novel application, of nonlinear phenomena in science and engineering. It offers a venue for researchers to make rapid exchange of ideas and techniques in nonlinear science and complexity. The submission of manuscripts with cross-disciplinary approaches in nonlinear science and complexity is particularly encouraged. Topics of interest: Nonlinear differential or delay equations, Lie group analysis and asymptotic methods, Discontinuous systems, Fractals, Fractional calculus and dynamics, Nonlinear effects in quantum mechanics, Nonlinear stochastic processes, Experimental nonlinear science, Time-series and signal analysis, Computational methods and simulations in nonlinear science and engineering, Control of dynamical systems, Synchronization, Lyapunov analysis, High-dimensional chaos and turbulence, Chaos in Hamiltonian systems, Integrable systems and solitons, Collective behavior in many-body systems, Biological physics and networks, Nonlinear mechanical systems, Complex systems and complexity. No length limitation for contributions is set, but only concisely written manuscripts are published. Brief papers are published on the basis of Rapid Communications. Discussions of previously published papers are welcome.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信