Paper Search

Complex Systems and Complexity Science >

2026 , Vol. 23 >Issue 3: 27 - 36

DOI: https://doi.org/10.13306/j.1672-3813.2026.03.004

Complex Network

Importance Recognition of Nodes in Hypernetworks Based on Multi-indicator Decision Matrix

  • ZHU Fuqi ,
  • JIA Xiaoyan ,
  • WEI Liang ,
  • LI Faxu
Expand
  • a. College of Computer; b. The State Key Laboratory of Tibetan Intelligent Information Processing and Application; c. Academy of Fine Arts, Qinghai Normal University, Xining 810008, China

Received date: 2024-08-14

  Revised date: 2024-09-13

  Online published: 2026-07-14

Fold

Abstract

Aiming at the problems that the methods for recognizing important nodes in hypernetworks ignore the influence of hyperedges on nodes and the evaluation indexes are relatively single, a method of node importance identification based on multi-indicator decision matrix is proposed. The method characterizes the local importance of node using the hyperdegree, considering the effect of hyperedges on nodes, the vector subgraph centrality is defined to portray the diffusion ability of nodes, and measures the global influence of node by reflecting its positional information through betweenness centrality, the contribution weights of each metric are determined based on entropy theory to assess the importance of the node in terms of its own influence and that of the associated hyperedges. Through the experimental validation of monotonicity, robustness, and SIR propagation model in different types of hypernetworks, the results show that the method can recognize the important nodes in the network more accurately and effectively.

Key words： hypernetwork; node importance; hyperedge effect; multi-indicator decision matrix; vector subgraph centrality

Cite this article

ZHU Fuqi , JIA Xiaoyan , WEI Liang , LI Faxu . Importance Recognition of Nodes in Hypernetworks Based on Multi-indicator Decision Matrix[J]. Complex Systems and Complexity Science, 2026 , 23(3) : 27 -36 . DOI: 10.13306/j.1672-3813.2026.03.004

References

[1] NEWMAN M E J. The structure and function of complex networks[J]. Siam Review, 2003, 45(2): 167-256.
[2] 杨湘浩, 阚顺玉, 叶旭, 等. 基于超网络的突发事件网络谣言传播模型研究[J]. 情报理论与实践, 2021, 44(10): 129-136.
YANG X H, KAN S Y, YE X, et al. Research on network rumor spreading model about emergencies based on super-network[J]. Information Studies: Theory & Application, 2021, 44(10): 129-136.
[3] 林春雨, 郭进利. 城市轨道交通超网络级联故障研究[J]. 小型微型计算机系统, 2023, 44(9): 2075-2083.
LIN C Y, GUO J L. Research on cascading failures of urban rail transit hypernetwork[J]. Journal of Chinese Computer Systems, 2023, 44(9): 2075-2083.
[4] 王志平, 王众托. 超网络理论及其应用[M]. 北京: 科学出版社, 2008: 206-222.
[5] DOROGOVTSEV S N, MENDES J F F. Evolution of networks[J]. Advances in Physics, 2002, 51(4): 1079-1187.
[6] ALBERT R, JEONG H, BARABÁSI A L. Diameter of the world-wide web[J]. Nature, 1999, 401(6749): 130-131.
[7] FREEMAN L C. A set of measures of centrality based on betweenness[J]. Sociometry, 1977, 40(1): 35-41.
[8] BRANDES U, BORGATTI S P, FREEMAN L C. Maintaining the duality of closeness and betweenness centrality[J]. Social Networks, 2016, 44: 153-159.
[9] XIAOLONG R, LINYUAN L. Review of ranking nodes in complex networks[J]. Chinese Science Bulletin, 2014, 59(13): 1175-1197.
[10] NEWMAN M E J. Finding community structure in networks using the eigenvectors of matrices[J]. Physical Review E, 2006, 74(3): 036104.
[11] ESTRADA E, RODRÍGUEZ-VELÁZQUEZ J A. Subgraph centrality and clustering in complex hyper-networks[J]. Physica A: Statistical Mechanics and Its Applications, 2006, 364: 581-594.
[12] 张连峰, 周红磊, 王丹, 等. 基于超网络理论的微博舆情关键节点挖掘[J]. 情报学报, 2019, 38(12): 1286-1296.
ZHANG L F, ZHOU H L, WANG D, et al. Key node mining of Weibo public opinion based on hypernetwork theory[J]. Journal of The China Society for Scientific and Technical Information, 2019, 38(12): 1286-1296.
[13] 周丽娜, 李发旭, 巩云超, 等. 基于 K-shell 的超网络关键节点识别方法[J]. 复杂系统与复杂性科学, 2021, 18(3): 15-22.
ZHOU L N, LI F X, GONG Y C, et al. Identification methods of vital nodes based on k-shell in hypernetworks[J]. Complex Systems and Complexity Science, 2021, 18(3): 15-22.
[14] KOVALENKO K, ROMANCE M, VASILYEVA E, et al. Vector centrality in hypergraphs[J]. Chaos, Solitons & Fractals, 2022, 162: 112397.
[15] XIE X W, ZHAN X X, ZHANG Z K, et al. Vital node identification in hypergraphs via gravity model[J]. Chaos: an Interdisciplinary Journal of Nonlinear Science, 2023, 33(1): 013104.
[16] GONG X L, WANG H C, WANG X Y, et al. Influence maximization on hypergraphs via multi-hop influence estimation[J]. Information Processing & Management, 2024, 61(3): 103683.
[17] 陈文杰, 曲建升, 黄珂敏. 基于超网络的核心技术识别方法[J]. 图书情报工作, 2024, 68(9): 65-75.
CHEN W J, QU J S, HUANG K M. Research on core technology identification based on hypernetwork[J]. Library and Information Service, 2024, 68(9): 65-75.
[18] SHANNON C E. A mathematical theory of communication[J]. ACM SIGMOBILE Mobile Computing and Communications Review, 2001, 5(1): 3-55.
[19] 周丽娜, 常笑, 胡枫. 利用邻接结构熵确定超网络关键节点[J]. 计算机工程与应用, 2022, 58(8): 76-82.
ZHOU L N, CHANG X, HU F. Using adjacent structure entropy to determine vital nodes of hypernetwork[J]. Journal of Computer Engineering & Applications, 2022, 58(8): 76-82.
[20] 吴英晗, 田阔, 李明达, 等. 利用节点传播熵识别超网络重要节点[J]. 计算机工程与应用, 2023, 59(19): 66-74.
WU Y H, TIAN K, LI M D, et al. Important node recognition in hypernetworks based on node propagation entropy[J]. Journal of Computer Engineering & Applications, 2023, 59(19): 66-74.
[21] 涂贵宇, 潘文林, 张天军. 基于信息熵的超网络重要节点识别方法[J]. 复杂系统与复杂性科学, 2025, 22(1): 18-25.
TU G Y, PAN W L, ZHANG T J. Identification methods of important nodes based on information entropy in hypernetwork[J]. Complex Systems and Complexity Science, 2025, 22(1): 18-25.
[22] 于会, 刘尊, 李勇军. 基于多属性决策的复杂网络节点重要性综合评价方法[J]. 物理学报, 2013, 62(2): 1-9.
YU H, LIU Z, LI Y J. Key nodes in complex networks identified by multi-attribute decision-making method[J]. Acta Phys Sin, 2013, 62(2): 1-9.
[23] BERGE C. Graphs and Hypergraphs[M]. New York: Elsevier, 1973.
[24] GRIFFITH D A, CHUN Y. Spatial autocorrelation in spatial interactions models: geographic scale and resolution implications for network resilience and vulnerability[J]. Networks and Spatial Economics, 2015, 15(2): 337-365.
[25] ESTRADA E, RODRIGUEZ-VELAZQUEZ J A. Subgraph centrality in complex networks[J]. Physical Review E, 2005, 71(5): 056103.
[26] AMBURG I, VELDT N, BENSON A R. Diverse and experienced group discovery via hypergraph clustering[C]//Proceedings of the 2022 SIAM International Conference on Data Mining (SDM). Alexandria: SIAM, 2022: 145-153.
[27] NI J, LI J, MCAULEY J. Justifying recommendations using distantly-labeled reviews and fine-grained aspects[C]//Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). Hongkong, China: Association for Computational Linguistics, 2019: 188-197.
Options
Outlines

/

〈 〉

Copyright © 2017 Editorial Office of Complex Systems and Complexity Science
Tel.：0532-85953597 E-mail:fzkxbjb@qdu.edu.cn