Node Importance Ranking in Complex Networks Based on Multicriteria Decision Making
Yuanzhi Yang, Lei Yu, Zhongliang Zhou, You Chen, Tian Kou
Source abstract
Measuring node importance in complex networks has great theoretical and practical significance for network stability and robustness. A variety of network centrality criteria have been presented to address this problem, but each of them focuses only on certain aspects and results in loss of information. Therefore, this paper proposes a relatively comprehensive and effective method to evaluate node importance in complex networks using a multicriteria decision‐making method. This method not only takes into account degree centrality, closeness centrality, and betweenness centrality, but also uses an entropy weighting method to calculate the weight of each criterion, which can overcome the influence of the subjective factor. To illustrate the effectiveness and feasibility of the proposed method, four experiments were conducted to rank node importance on four real networks. The experimental results showed that the proposed method can rank node importance more comprehensively and accurately than a single centrality criterion.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.