Link deletion in directed complex networks
arXiv:1809.00296 · doi:10.1016/j.physa.2018.09.156
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.
arXiv comment13 pages, 6 figures, submitted to Physica A
References in corpus (17)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Error and attack tolerance of complex networks
- Efficient Behavior of Small-World Networks
- Catastrophic cascade of failures in interdependent networks
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Cascade-based attacks on complex networks
- Attack vulnerability of complex networks
- Breakdown of the Internet under intentional attack
- A model for cascading failures in complex networks
- Efficiency of Scale-Free Networks: Error and Attack Tolerance
- Structure and dynamics of core-periphery networks
- Robustness of the European power grids under intentional attack
- Effect of edge removal on topological and functional robustness of complex networks
- Public Transport Networks under Random Failure and Directed Attack
- Connectivity Damage to a Graph by the Removal of an Edge or a Vertex