Study On The Network Invulnerability Based On Local Betweenness-Degree Centrality

For the study of complex systems or networks,most researchers are researching based on graph theory knowledge.In the process of continuous research on complex networks,a series of results on this research have also been obtained.However,the current study is based on theoretical analysis and is not very mature for practical applications.Nodes in complex networks are subject to various deliberate or unintentional attacks,which cause various degrees of damage to the network.In particular,attack on core nodes in the network may cause serious damage to the entire network.Therefore,research on the invulnerability of complex networks has become a very important research topic.In view of the research on the invulnerability of complex networks,the research is mainly based on graph theory,analysis and simulation.To study the invulnerability problem in complex systems or networks,it is necessary to accurately characterize the behavior of each node in the evolution process of the network system,so as to explore the laws contained in the network and build a realistic complex system or network on this basis.A consistent model,which is crucial for the study of the issue of resilience.Since most of the networks in real life can be abstracted as the existence of connections between nodes and edges,the study of complex networks can expand and enrich the theoretical basis in the research process by constructing appropriate network models,and study and analyze network models.Combine the actual reality network,find out the inherent laws contained in it,and provide pioneering ideas for the study of complex networks.In this paper,starting from the traditional metrics of importance of nodes,combined with the dual effects of node degree and inequality on the importance of nodes in the network,based on the research on the central indicators of existing intensities,we propose that by limiting the length of the shortest path,Local index-centrality index,which takes into account the double influence of the in-degree and degree on the node,and evaluates the importance of the node.In order to moreclearly illustrate the contribution of a single node to the overall network's invulnerability,a node invulnerability index is proposed based on the local mediation-degree centrality index.On this basis,the network invulnerability mediation-degree entropy model and its algorithm are further proposed.The model is mainly used to measure and evaluate the invulnerability of the entire network.Attack experiments were performed on simulated networks in random and deliberate attacks,and comparisons were made based on the degree of centricity,betweenness centrality's attack strategy and attack strategy based on the paper betweenness-degree centricity,validation of the presented centricity index in measuring network anti-destroying ability has certain advantage.