Abstract

Correctly measuring the importance of nodes in a complex network is critical for studying the robustness of the network, and designing a network security policy based on these highly important nodes can effectively improve security aspects of the network, such as the security of important data nodes on the Internet or the hardening of critical traffic hubs. Currently included are degree centrality, closeness centrality, clustering coefficient, and H-index. Although these indicators can identify important nodes to some extent, they are influenced by a single evaluation perspective and have limitations, so most of the existing evaluation methods cannot fully reflect the node importance information. In this paper, we propose a multi-attribute critic network decision indicator (MCNDI) based on the CRITIC method, considering the H-index, closeness centrality, k-shell indicator, and network constraint coefficient. This method integrates the information of network attributes from multiple perspectives and provides a more comprehensive measure of node importance. An experimental analysis of the Chesapeake Bay network and the contiguous USA network shows that MCNDI has better ranking monotonicity, more stable metric results, and is highly adaptable to network topology. Additionally, deliberate attack simulations on real networks showed that the method exhibits high convergence speed in attacks on USAir97 networks and technology routes networks.

Highlights

  • Complex network systems are widely distributed in the real world

  • In the social network analysis method, the main idea is that the importance of nodes is equal to the salience; the method does not destroy the connectivity of the network in the analysis process in order to ensure the topological integrity of the network

  • We introduce the CRITIC method proposed by Diakoulak [27] into the node importance ranking, which can integrate the attribute information of multiple evaluation criteria scores without subjective involvement and comprehensively assess the importance of the solution to be selected based on the intrinsic nature of the scoring data to obtain the base ranking of the solution to be selected

Read more

Summary

Introduction

Complex network systems are widely distributed in the real world. With the discovery of scale-free distributions [1], small worlds [2], and community-based properties possessed by complex networks, complex network science has gained wide attention in computer science, biological science, transportation planning, social science [3,4,5,6], and other fields.The node importance metric is one of the key research directions. In the social network analysis method, the main idea is that the importance of nodes is equal to the salience; the method does not destroy the connectivity of the network in the analysis process in order to ensure the topological integrity of the network. This is generally achieved through the use of a centrality indicator to measure the importance of nodes; the indicators that have been proposed include degree centrality, closeness centrality, betweenness centrality, clustering coefficient, Hirsch’s index, and k-shell indicator [12,13,14,15,16,17]

Methods
Results
Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call