Identification of Node Importance Order Structure Based on Multi-Order Neighborhood Contribution of Complex Network

HU Gang; LU Zhi-yu; WANG Le-meng; XU Li-peng; XU Xiang; REN Yong-jun

doi:10.12263/DZXB.20221109

您当前的位置：

首页 >

文章列表页 >

Identification of Node Importance Order Structure Based on Multi-Order Neighborhood Contribution of Complex Network

PAPERS | 更新时间：2025-12-08

- Identification of Node Importance Order Structure Based on Multi-Order Neighborhood Contribution of Complex Network
- ACTA ELECTRONICA SINICA Vol. 51, Issue 7, Pages: 1956-1963(2023)
- 作者机构：
  
  1.安徽工业大学管理科学与工程学院,安徽马鞍山 243032
  2.东南大学经济管理学院,江苏南京 211189
  3.国防科技大学信息系统工程重点实验室,湖南长沙 410073
  4.南京信息工程大学计算机与软件学院,江苏南京 210044
- 作者简介：
- 基金信息：
- DOI：10.12263/DZXB.20221109
  CLC： TP393
- Received：30 September 2022，
  
  Revised：2023-05-24，
  
  Published：25 July 2023
- 稿件说明：
移动端阅览
胡钢,卢志宇,王乐萌等.基于复杂网络多阶邻域贡献度的节点重要性序结构辨识[J].电子学报,2023,51(07):1956-1963.

HU Gang,LU Zhi-yu,WANG Le-meng,et al.Identification of Node Importance Order Structure Based on Multi-Order Neighborhood Contribution of Complex Network[J].ACTA ELECTRONICA SINICA,2023,51(07):1956-1963.
胡钢,卢志宇,王乐萌等.基于复杂网络多阶邻域贡献度的节点重要性序结构辨识[J].电子学报,2023,51(07):1956-1963. DOI： 10.12263/DZXB.20221109.

HU Gang,LU Zhi-yu,WANG Le-meng,et al.Identification of Node Importance Order Structure Based on Multi-Order Neighborhood Contribution of Complex Network[J].ACTA ELECTRONICA SINICA,2023,51(07):1956-1963. DOI： 10.12263/DZXB.20221109.

摘要

为更精细化辨识节点重要性，本文研究节点多阶交互演化对节点重要性序结构形成的影响，提出基于复杂网络多阶邻域贡献度的节点重要性序结构辨识系统模型.首先，基于节点间不同阶层交互关系和节点多阶邻域规模异质性程度构建多阶邻域贡献度模型；通过节点多阶圈信息集结节点自身多阶邻域空间结构信息；其次，构建融合多阶邻域空间位置信息贡献和多阶圈信息贡献的节点重要性辨识系统模型，给出节点序结构辨识算法；最后，仿真分析表明在各真实网络中本文算法相比经典算法最高提升88%节点辨识率，以0.5资源投入进行网络攻击，分别最大提升67.47%，39.40%和20.17%攻击效用值.

Abstract

In order to finely identify the node importance

this paper studies the influence of node multi-order interaction evolution on node importance formation

and proposes a system model of node importance sequence structure identification based on multi-order neighborhood contribution of complex networks. Firstly

a multi-order neighborhood contribution 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 information by nodes' multi-order circle information. Secondly

a node importance identification model is constructed by integrating 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 attack utility value by up to 67.47%

39.40% and 20.17% with 0.5 resource input for network attacks

respectively.

关键词

Keywords

references

YU E Y , FU Y , TANG Q , et al . A re-ranking algorithm for identifying influential nodes in complex networks [J]. IEEE Access , 2020 , 8 : 211281 - 211290 .

BATOOL K , NIAZI M A . Towards a methodology for validation of centrality measures in complex networks [J]. PLoS One , 2014 , 9 ( 4 ): e90283 .

ZHANG Y L , YANG N D , LALL U . Modeling and simulation of the vulnerability of interdependent power-water infrastructure networks to cascading failures [J]. Journal of Systems Science and Systems Engineering , 2016 , 25 ( 1 ): 102 - 118 .

胡钢 , 许丽鹏 , 徐翔 . 基于时序网络层间同构率动态演化的重要节点辨识 [J]. 物理学报 , 2021 , 70 ( 10 ): 349 - 360 .

HU G , XU L P , XU X . Identification of important nodes based on dynamic evolution of inter-layer isomorphism rate in temporal networks [J]. Acta Physica Sinica , 2021 , 70 ( 10 ): 349 - 360 . (in Chinese)

HAGE P , HARARY F . Eccentricity and centrality in networks [J]. Social Networks , 1995 , 17 ( 1 ): 57 - 63 .

BORGATTI S P , EVERETT M G . A graph-theoretic perspective on centrality [J]. Social Networks , 2006 , 28 ( 4 ): 466 - 484 .

KATZ L . A new status index derived from sociometric analysis [J]. Psychometrika , 1953 , 18 ( 1 ): 39 - 43 .

STEPHENSON K , ZELEN M . Rethinking centrality: Methods and examples [J]. Social Networks , 1989 , 11 ( 1 ): 1 - 37 .

BAVELAS A . A mathematical model for group structures [J]. Human Organization , 1948 , 7 ( 3 ): 16 - 30 .

FREEMAN L C . A set of measures of centrality based on betweenness [J]. Sociometry , 1977 , 40 ( 1 ): 35 - 41 .

FREEMAN L C , BORGATTI S P , WHITE D R . Centrality in valued graphs: A measure of betweenness based on network flow [J]. Social Networks , 1991 , 13 ( 2 ): 141 - 154 .

NEWMAN M E J . A measure of betweenness centrality based on random walks [J]. Social Networks , 2005 , 27 ( 1 ): 39 - 54 .

ALBERT R , JEONG H , BARABÁSI A L . Diameter of the world-wide web [J]. Nature , 1999 , 401 ( 6749 ): 130 - 131 .

王雨 , 郭进利 . 基于多重影响力矩阵的有向加权网络节点重要性评估方法 [J]. 物理学报 , 2017 , 66 ( 5 ): 19 - 30 .

WANG Y , GUO J L . Evaluation method of node importance in directed-weighted complex network based on multiple influence matrix [J]. Acta Physica Sinica , 2017 , 66 ( 5 ): 19 - 30 . (in Chinese)

FOWLER J H , CHRISTAKIS N A . Dynamic spread of happiness in a large social network: Longitudinal analysis over 20 years in the Framingham heart study [J]. BMJ , 2008 , 337(dec04 2): a2338.

CHEN D B , LÜ L Y , SHANG M S , et al . Identifying influential nodes in complex networks [J]. Physica A: Statistical Mechanics and Its Applications , 2012 , 391 ( 4 ): 1777 - 1787 .

CHEN D B , GAO H , LÜ L Y , et al . Identifying influential nodes in large-scale directed networks: The role of clustering [J]. PLoS One , 2013 , 8 ( 10 ): e77455 .

范文礼 , 刘志刚 . 基于传输效率矩阵的复杂网络节点重要度排序方法 [J]. 西南交通大学学报 , 2014 , 49 ( 2 ): 337 - 342 .

FAN W L , LIU Z G . Ranking method for node importance based on efficiency matrix [J]. Journal of Southwest Jiaotong University , 2014 , 49 ( 2 ): 337 - 342 . (in Chinese)

HU P , FAN W L , MEI S W . Identifying node importance in complex networks [J]. Physica A: Statistical Mechanics and Its Applications , 2015 , 429 : 169 - 176 .

KITSAK M , GALLOS L K , HAVLIN S , et al . Identification of influential spreaders in complex networks [J]. Nature Physics , 2010 , 6 ( 11 ): 888 - 893 .

邓凯旋 , 陈鸿昶 , 黄瑞阳 . 一种基于改进K-shell的节点重要性排序方法 [J]. 计算机应用研究 , 2017 , 34 ( 10 ): 3017 - 3019,3084 .

DENG K X , CHEN H C , HUANG R Y . Method of node importance ranking based on improved K-shell [J]. Application Research of Computers , 2017 , 34 ( 10 ): 3017 - 3019,3084 . (in Chinese)

李懂 , 席景科 , 孙成成 . 融合度与K核迭代次数的节点重要性排序算法 [J]. 计算机工程与设计 , 2019 , 40 ( 6 ): 1518 - 1522,1539 .

LI D , XI J K , SUN C C . Node importance ranking algorithm with fusing degree and K-shell iteration number [J]. Computer Engineering and Design , 2019 , 40 ( 6 ): 1518 - 1522,1539 . (in Chinese)

ZENG A , ZHANG C J . Ranking spreaders by decomposing complex networks [J]. Physics Letters A , 2013 , 377 ( 14 ): 1031 - 1035 .

LIU J G , REN Z M , GUO Q . Ranking the spreading influence in complex networks [J]. Physica A Statistical Mechanics and Its Applications , 2013 , 392 ( 18 ): 4154 - 4159 .

YANG X , XIAO F Y . An improved gravity model to identify influential nodes in complex networks based on k-shell method [J]. Knowledge-Based Systems , 2021 , 227 : 107198 .

SUN P G , MIAO Q G , STAAB S . Community-based k-shell decomposition for identifying influential spreaders [J]. Pattern Recognition , 2021 , 120 : 108130 .

MORONE F , MAKSE H A . Influence maximization in complex networks through optimal percolation [J]. Nature , 2015 , 524 ( 7563 ): 65 - 68 .

胡钢 , 徐翔 , 高浩 , 等 . 基于邻接信息熵的网络节点重要性识别算法 [J]. 系统工程理论与实践 , 2020 , 40 ( 3 ): 714 - 725 .

HU G , XU X , GAO H , et al . Node importance recognition algorithm based on adjacency information entropy in networks [J]. Systems Engineering—Theory & Practice , 2020 , 40 ( 3 ): 714 - 725 . (in Chinese)

ZHONG S , ZHANG H T , DENG Y . Identification of influential nodes in complex networks: A local degree dimension approach [J]. Information Sciences , 2022 , 610 : 994 - 1009 .

胡钢 , 高浩 , 徐翔 , 等 . 基于重要度传输矩阵的复杂网络节点重要性辨识方法 [J]. 电子学报 , 2020 , 48 ( 12 ): 2402 - 2408 .

HU G , GAO H , XU X , et al . Importance identification method of complex network nodes based on importance transfer matrix [J]. Acta Electronica Sinica , 2020 , 48 ( 12 ): 2402 - 2408 . (in Chinese)

ZACHARY W W . An information flow model for conflict and fission in small groups [J]. Journal of Anthropological Research , 1977 , 33 ( 4 ): 452 - 473 .

COLIZZA V , PASTOR-SATORRAS R , VESPIGNANI A . Reaction—diffusion processes and metapopulation models in heterogeneousnetworks [J]. Nature Physics , 2007 , 3 ( 4 ): 276 - 282 .

GLEISER P M , DANON L . Community structure in jazz [J]. Advances in Complex Systems , 2003 , 6 ( 4 ): 565 - 573 .

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Dynamic Community Discovery Method via Fusing Node Change Information

Statistical Mechanics Properties of Bernoulli Generator Matrix Codes

Community Detection in Complex Networks Based on Link Label Propagation

Related Author

CHEN Qi-mai

YU Peng

LIU Xing-yu

CHENG Jun-wei

CHENG Qi-wei

HE Chao-bo

MA Xiao

MENG Fan-hui

Related Institution

Vivo Mobile Communication Co., Ltd.

School of Computer Science, South China Normal University

Guangdong Province Key Laboratory of Information Security Technology

School of Computer Science and Engineering， Sun Yat-Sen University

School of Systems Science and Engineering， Sun Yat-Sen University

⁰