期刊文献+

基于复杂网络多阶邻域贡献度的节点重要性序结构辨识 被引量:3

Identification of Node Importance Order Structure Based on Multi-Order Neighborhood Contribution of Complex Network
下载PDF
导出
摘要 为更精细化辨识节点重要性,本文研究节点多阶交互演化对节点重要性序结构形成的影响,提出基于复杂网络多阶邻域贡献度的节点重要性序结构辨识系统模型.首先,基于节点间不同阶层交互关系和节点多阶邻域规模异质性程度构建多阶邻域贡献度模型;通过节点多阶圈信息集结节点自身多阶邻域空间结构信息;其次,构建融合多阶邻域空间位置信息贡献和多阶圈信息贡献的节点重要性辨识系统模型,给出节点序结构辨识算法;最后,仿真分析表明在各真实网络中本文算法相比经典算法最高提升88%节点辨识率,以0.5资源投入进行网络攻击,分别最大提升67.47%,39.40%和20.17%攻击效用值. In order to finely identify the node importance,this paper studies the influence of node multi-order interac⁃tion evolution on node importance formation,and proposes a system model of node importance sequence structure identifi⁃cation based on multi-order neighborhood contribution of complex networks.Firstly,a multi-order neighborhood contribu⁃tion model is constructed based on different hierarchical interactions between nodes and the degree of heterogeneity of nodes'multi-order neighborhood scale;and characterize the nodes'own multi-order neighborhood spatial structure infor⁃mation by nodes'multi-order circle information.Secondly,a node importance identification model is constructed by inte⁃grating the contributions of multi-order neighborhood spatial location information and multi-order circle information,and a node order structure identification algorithm is given.Finally,the simulation analysis shows that this algorithm improves the node identification rate by up to 88%compared with the classical algorithm in each real network,and improves the at⁃tack utility value by up to 67.47%,39.40%and 20.17%with 0.5 resource input for network attacks,respectively.
作者 胡钢 卢志宇 王乐萌 许丽鹏 徐翔 任勇军 HU Gang;LU Zhi-yu;WANG Le-meng;XU Li-peng;XU Xiang;REN Yong-jun(School of Management Science and Engineering,Anhui University of Technology,Maanshan,Anhui 243032,China;School of Economics and Management,Southeast University,Nanjing,Jiangsu 211189,China;Science and Technology on Information Systems Engineering Laboratory,National University of Defense Technology,Changsha,Hunan 410073,China;School of Computer Science,Nanjing University of Information Science and Technology,Nanjing,Jiangsu 210044,China)
出处 《电子学报》 EI CAS CSCD 北大核心 2023年第7期1956-1963,共8页 Acta Electronica Sinica
基金 国家自然科学基金(No.71772002) 安徽省自然科学基金(No.2108085MG236) 安徽省高校自然科学研究项目(No.KJ2021A0385)。
关键词 复杂网络 节点重要性序结构 多阶邻域矩阵 圈结构贡献度 邻域k-shell值 complex networks node importance order structure multi-order neighborhood matrix contribution of the circle structure neighborhood k-shell value
  • 相关文献

参考文献8

二级参考文献48

  • 1陈勇,胡爱群,胡啸.通信网中节点重要性的评价方法[J].通信学报,2004,25(8):129-134. 被引量:89
  • 2段凡丁.关于最短路径的SPFA快速算法[J].西南交通大学学报,1994,29(2):207-212. 被引量:57
  • 3谭跃进,吴俊,邓宏钟.复杂网络中节点重要度评估的节点收缩方法[J].系统工程理论与实践,2006,26(11):79-83. 被引量:257
  • 4陈晓刚,孙可,曹一家.基于复杂网络理论的大电网结构脆弱性分析[J].电工技术学报,2007,22(10):138-144. 被引量:148
  • 5CALLAWAY D S,NEWMAN M E J,STROGATEZ SH,et al. Network robustness and fragility:percolationon random graphs[J]. Phys. Rev. Lett. , 2000,85(25):5468-5471.
  • 6BRIN S, PAGE L. The anatomy of a largescalehypertextual web search engine[J]. Computer Networks& ISDN Systems,1998,30:107-117.
  • 7KLEINBERG J M. Authoritative sources in ahyperlinked environment[C]∥Proceedings of the NinthAnnual ACMSIAM Symposium on Discrete Algorithms,SODA 98, Society for Industrial and AppliedMathematics. Philadelphia:[s. n.],1998:668-677.
  • 8CORLEY H W,SHA D Y. Most vital links and nodesin weighted networks[J]. Operations Research Letters,1982,1(4):157-160.
  • 9NARDELLI E,PROIETTI G,WIDMAYER P. Findingthe most vital node of a shortest path[J]. TheoreticalComputer Science,2001,296(1):167-177.
  • 10CHEN Duanbing,L Linyuan. SHANG Mingsheng,etal. Identifying influential nodes in complexnetworks[J]. Physica A,2012,391(4):1777-1787.

共引文献106

同被引文献30

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部