Measuring and Improving Communication Robustness of Networks

In this letter, we explore the link-adding method to improve communication robustness of networks. Firstly, a robustness measure called communication robustness (CR) is presented, which not only confirms the global effect of the largest connected component on the network communicability, but captures the local communicability of all small connected components. Secondly, we respectively put forward a simulated annealing algorithm, a heuristic algorithm called $r$ -Weak Interconnection Algorithm ( $r$ -WIA) and a greedy algorithm to improve $CR$ of networks, where the 2-WIA can fast improve the network robustness with low time complexity $O(N^{2})$ . Finally, the experimental results verify the effectiveness of the proposed algorithms.