Generalized -core pruning process on directed networks
arXiv:1701.03404 · doi:10.1088/1742-5468/aa71e0
Abstract
The resilience of a complex interconnected system concerns the size of the macroscopic functioning node clusters after external perturbations based on a random or designed scheme. For a representation of the interconnected systems with directional or asymmetrical interactions among constituents, the directed network is a convenient choice. Yet how the interaction directions affect the network resilience still lacks thorough exploration. Here, we study the resilience of directed networks with a generalized -core pruning process as a simple failure procedure based on both the in- and out-degrees of nodes, in which any node with an in-degree or an out-degree is removed iteratively. With an explicitly analytical framework, we can predict the relative sizes of residual node clusters on uncorrelated directed random graphs. We show that the discontinuous transitions rise for cases with or , and the unidirectional interactions among nodes drive the networks more vulnerable against perturbations based on in- and out-degrees separately.
arXiv comment21 pages, 8 figures, 1 table
References in corpus (35)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Error and attack tolerance of complex networks
- Assortative mixing in networks
- Catastrophic cascade of failures in interdependent networks
- The large-scale organization of metabolic networks
- Random graphs with arbitrary degree distributions and their applications
- Identification of influential spreaders in complex networks
- Multilayer Networks
- The structure and dynamics of multilayer networks
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Critical phenomena in complex networks
- Universal Behavior of Load Distribution in Scale-free Networks
- Community structure in directed networks
- New Model of Internet Topology Using k-shell Decomposition
- MEDUSA - New Model of Internet Topology Using k-shell Decomposition
- k-core organization of complex networks
- Clustering and Community Detection in Directed Networks: A Survey
- Giant strongly connected component of directed networks
- Network dismantling
- Percolation in Directed Scale-Free Networks
- On the Origins of Hierarchy in Complex Networks
- Generalized percolation in random directed networks
- Redundant interdependencies boost the robustness of multilayer networks
- Core percolation on complex networks
- Local structure of directed networks
- Articulation Points in Complex Networks
- k-Core percolation on multiplex networks
- Inducing Effect on the Percolation Transition in Complex Networks
- Mapping the Structure of Directed Networks: Beyond the "Bow-tie" Diagram
- Analytic solution of a static scale-free network model
- Critical dynamics of the k-core pruning process
- Core organization of directed complex networks