Multi-hop Based Centrality of a Path in Complex Network

It is of great significance to study the robustness of different networks under different attacks. To attack the network more effectively, a new attack centrality strategy for a path based on the multi-hop by mapping the problems into percolation, which is called multi-hop centrality, is proposed in this paper. This method is tested respectively in two kinds of model networks (ER network, SF network) and some real networks by removing the path with the largest centrality from a network iteratively, and then calculating the network efficiency, the maximum size of the connected sub-graph and the corresponding number of attacks. The experiment results demonstrate that our method performs good. It also shows that more homogeneous the denser of networks is, the higher robust of the network is, and the better it against with iterative path attack.