Incremental Computation of Effective Graph Resistance for Improving Robustness of Complex Networks: A Comparative Study

Abstract

Real-world infrastructures are often subject to random failures or intentional attacks that can significantly impact their robustness and hence many processes taking place on them. In this paper, we focus on the robustness of complex networks by proposing a link addition strategy for improving the network robustness. The approach exploits the incremental computation of the Moore-Penrose pseudoinverse matrix to efficiently compute the effective graph resistance when a new link is added to the network. Experiments on both real-world and synthetic data sets show that the strategy provides a good trade-off between a low percentage error of effective graph resistance with respect to the exhaustive search and the simulation time needed to obtain the optimal link.