Correlations between thresholds and degrees: An analytic approach to model attacks and failure cascades
arXiv:1706.04451 · doi:10.1103/PhysRevE.98.022306
Abstract
Two node variables determine the evolution of cascades in random networks: a node's degree and threshold. Correlations between both fundamentally change the robustness of a network, yet, they are disregarded in standard analytic methods as local tree or heterogeneous mean field approximations because of the bad tractability of order statistics. We show how they become tractable in the thermodynamic limit of infinite network size. This enables the analytic description of node attacks that are characterized by threshold allocations based on node degree. Using two examples, we discuss possible implications of irregular phase transitions and different speeds of cascade evolution for the control of cascades.
References in corpus (17)
- Error and attack tolerance of complex networks
- Epidemic processes in complex networks
- Random graphs with arbitrary degree distributions and their applications
- Network robustness and fragility: Percolation on random graphs
- Attack vulnerability of complex networks
- Breakdown of the Internet under intentional attack
- Hysteresis and hierarchies: dynamics of disorder-driven first-order phase transformations
- Recent advances in percolation theory and its applications
- Failure Processes in Elastic Fiber Bundles
- Systemic Risk in a Unifying Framework for Cascading Processes on Networks
- Binary-state dynamics on complex networks: pair approximation and beyond
- Decelerating microdynamics can accelerate macrodynamics in the voter model
- Vulnerability and co-susceptibility determine the size of network cascades
- Systemic risk in multiplex networks with asymmetric coupling and threshold feedback
- How Damage Diversification Can Reduce Systemic Risk
- Social contagion with degree-dependent thresholds
- A framework for cascade size calculations on random networks