摘要
The paper studies the robustness of the network in terms of the network structure. We define a strongly dominated relation between nodes and then we use the relation to merge the network. Based on that, we design a dominated clustering algorithm aiming at finding the critical nodes in the network. Furthermore, this merging process is lossless which means the original structure of the network is kept. In order to realize the visulization of the network, we also apply the lossy consolidation to the network based on detection of the community structures. Simulation results show that compared with six existed centrality algorithms, our algorithm performs better when the attack capacity is limited. The simulations also illustrate our algorithm does better in assortative scale-free networks.
The paper studies the robustness of the network in terms of the network structure. We define a strongly dominated relation between nodes and then we use the relation to merge the network. Based on that, we design a dominated clustering algorithm aiming at finding the critical nodes in the network. Furthermore, this merging process is lossless which means the original structure of the network is kept. In order to realize the visulization of the network, we also apply the lossy consolidation to the network based on detection of the community structures. Simulation results show that compared with six existed centrality algorithms, our algorithm performs better when the attack capacity is limited. The simulations also illustrate our algorithm does better in assortative scale-free networks.
基金
supported by the National Natural Science Foundation of China(Grant No.61471055)
