Link deletion in directed complex networks.

Abstract We present a systematic and detailed study of the robustness of directed networks under random and targeted removal of links. We work with a set of network models of random and scale free type, generated with specific features of clustering and assortativity. Various strategies like random deletion of links, or deletions based on betweenness centrality and degrees of source and target nodes, are used to breakdown the networks. The robustness of the networks to the sustained loss of links is studied in terms of the sizes of the connected components and the inverse path lengths. The effects of clustering and 2-node degree correlations, on the robustness to attack, are also explored. We provide specific illustrations of our study on three real-world networks constructed from protein–protein interactions and from transport data. Highlights • The study details the response and robustness of directed networks to loss of links. • It includes results on both standard network models as well as three real networks. • The strategies for removal of links are based on global and local network properties. • Responses are characterized by the extent and efficiency of structural connectivity. • The specific roles of clustering and 2-node degree correlations are also explored. [ABSTRACT FROM AUTHOR]