基于改进随机游走的复杂网络节点重要性评估
Evaluation of Node Importance in Complex Networks Based on Improved Random Walk
DOI: 10.12677/ORF.2023.131036, PDF,    国家科技经费支持
作者: 蔡晓楠, 郑中团*:上海工程技术大学数理与统计学院,上海
关键词: 有向复杂网络节点重要度节点相似性引力模型相对路径Directed Complex Network Node Importance Node Similarity Gravitational Model Relative Path
摘要: 复杂系统可以抽象为复杂网络,重要节点评估与识别是复杂网络的一个热点问题。针对网络拓扑结构和节点自身属性对有向复杂网络重要节点的影响,提出基于改进随机游走的节点重要性评估方法。首先对节点的出度和入度分别附参数求出节点联合度数为节点质量,并通过调节参数评估节点出度与入度对节点重要性的影响;其次使用SimRank算法得任意两个节点相似值的倒数为引力模型的距离,考虑节点间的拓扑结构;最后通过相对路径数比值做引力模型的系数,考虑节点间信息传播的影响效果。任意两节点的作用力构造引力矩阵,将引力矩阵行归一化构造转移矩阵,然后随机游走对节点进行排序。使用极大强连通性、极大弱连通性和脆弱性等评估指标在四个真实网络上进行实验对比,结果表明,提出的算法相比LeaderRank、PageRank、HITs等方法能更准确地评估节点的重要性。将复杂网络的多种特征进行融合,新创建的重要节点评估方法可以运用在生物领域和经济贸易领域等。
Abstract: Complex systems can be abstracted as complex networks. The evaluation and identification of important nodes is a hot issue in complex networks Aiming at the influence of network topology and node attributes on important nodes in directed complex networks, a node importance evaluation method based on improved random walk is proposed. Firstly, the joint degree of the node is calculated as the node quality by attaching parameters to the outgoing degree and incoming degree of the node respectively, and the influence of the outgoing degree and incoming degree of the node on the node importance is evaluated by adjusting parameters; Secondly, SimRank algorithm is used to get the reciprocal of the similarity value of any two nodes as the distance of the gravity model, considering the topology between nodes; Finally, the relative path number ratio is used as the coefficient of the gravity model to consider the effect of information transmission between nodes. The gravitational matrix is constructed by the force of any two nodes, and the transfer matrix is constructed by normalizing the rows of the gravitational matrix, and then the nodes are ranked by random walking. The experimental comparison is conducted on four real networks using the evaluation indicators of maximum strong connectivity, maximum weak connectivity and vulnerability. The results show that the proposed algorithm can more accurately evaluate the importance of nodes than the methods of Leader Rank, Page Rank, HITs, etc., ntegrate multiple features of complex networks, and the newly created evaluation method of important nodes can be applied in the biological field, economic and trade fields, etc.
文章引用:蔡晓楠, 郑中团. 基于改进随机游走的复杂网络节点重要性评估[J]. 运筹与模糊学, 2023, 13(1): 329-340. https://doi.org/10.12677/ORF.2023.131036

参考文献

[1] 司守奎, 孙玺菁. 复杂网络的算法与应用[M]. 北京: 国防工业出版社, 2015: 1-23.
[2] 汪小帆, 李翔, 陈关荣. 复杂网络理论及其应用[M]. 北京: 清华大学出版社, 2006: 1-100.
[3] 任晓龙, 吕琳媛. 网络重要节点排序方法综述[J]. 科学通报, 2014, 59(13): 1175-1197.
[4] Boccalettiab, S., Bianconic, G., et al. (2014) The Structure and Dynamics of Multilayer Networks. Physics Reports, 544, 1-122. [Google Scholar] [CrossRef] [PubMed]
[5] 朱军芳, 陈端兵, 周涛, 等. 网络科学中相对重要节点挖掘方法综述[J]. 电子科技大学学报, 2019, 48(4): 595-503.
[6] 赫南, 李德毅, 淦文燕, 朱熙. 复杂网络中重要性节点发掘综述[J]. 计算机科学, 2007, 34(12): 1-5.
[7] 段杰明, 尚明生, 蔡世民. 基于自规避随机游走的节点排序算法[J]. 物理学报, 2015, 64(20): 1-8.
[8] 王凯莉, 邬春学, 艾均, 等. 基于多阶邻居壳数的向量中心性度量方法[J]. 物理学报, 2019, 68(19): 235-245.
[9] 马媛媛, 韩华, 瞿倩倩. 基于节点亲密度的重要性评估算法[J]. 计算机科学, 2021, 48(5): 140-146.
[10] 张宪立, 唐建新. 一种新的复杂网络节点重要性评估方法[J]. 计算机工程, 2021, 47(2): 139-151.
[11] 胡钢, 高浩, 徐翔, 等. 基于重要度传输矩阵的复杂网络节点重要性辨识方法[J]. 电子学报, 2020, 48(12): 2402-2408.
[12] 李秋晖, 韩华, 马媛媛, 等. 基于引力模型及相对路径数的节点重要度评估算法[J]. 计算机应用研究, 2022, 39(3): 764-769.
[13] 何建军, 李仁发. 改进的随机游走模型节点排序方[J]. 计算机工程与应用, 2011, 47(12): 87-89.
[14] 何建军. 复杂网络节点重要性评价研究[D]: [硕士学位论文]. 长沙: 湖南大学, 2010.
[15] Janaswamy, R. (2003) Path Loss Predictions in the Presence of Buildings on Flat Terrain: A 3-D Vector Parabolic Equation Approach. IEEE Transactions on Antennas & Propagation, 51, 1716-1728. [Google Scholar] [CrossRef
[16] 王林, 张一帆. 基于节点相似度的有向网络社团检测算法[J]. 软件与算法, 2017, 36(3): 19-22.
[17] Li, Q., Zhou, T., Lv, L.Y., et al. (2014) Identifying Influential Spreaders by Weighted Leader Rank. Physica A: Statistical Mechanics and Its Applications, 404, 47-55. [Google Scholar] [CrossRef
[18] 孙连, 李书琴, 刘斌. 基于加权 LeaderRank 的用户社交网络排序算法[J]. 计算机工程, 2019, 45(10): 196-202.
[19] 刘建国, 任卓明, 郭强, 等. 复杂网络中节点重要性排序的研究进展[J]. 物理学报, 2013, 62(17): 1-10.
[20] ENZYMES-G1. https://networkrepository.com/ENZYMES-g1.php
[21] DATASET: High School Contact and Friendship Networks. http://www.sociopatterns.org/datasets/high-school-contact-and-friendship-networks
[22] Datasets Released for Reproducibility. https://manliodedomenico.com/data.php
[23] 陈燕, 江克勤. 求强连通分量的几种算法的实现与分析[J]. 电脑知识与技术, 2011, 7(9): 2140-2142.
[24] 曹雁锋, 张先伟. 一种强连通判定算法[J]. 计算机应用与软件, 2007, 24(4): 152-153.
[25] 王小霞, 姜金平. L-双拓扑空间中几类弱连通性及其等价刻画[J]. 河南科学, 2013, 31(9): 1343-1345.
[26] 王金山, 任蓓. 拓扑空间中的弱连通集[J]. 安徽机电学院学报, 2002, 17(2): 64-66.