A network-specific approach to percolation in networks with bidirectional links

Abstract

Methods for determining the percolation threshold usually study the behavior of network ensembles and are often restricted to a particular type of probabilistic node/link removal strategy. We propose a network-specific method to determine the connectivity of nodes below the percolation threshold and offer an estimate to the percolation threshold in networks with bidirectional links. Our analysis does not require the assumption that a network belongs to a specific ensemble and can at the same time easily handle arbitrary removal strategies (previously an open problem for undirected networks). In validating our analysis, we find that it predicts the effects of many known complex structures (e.g., degree correlations) and may be used to study both probabilistic and deterministic attacks.

6 pages, 8 figures

References in corpus (7)

• Efficient Immunization Strategies for Computer Networks and Populations
• Mitigation of Malicious Attacks on Networks
• Cascade control and defense in complex networks
• Characterizing the dynamical importance of network nodes and links
• Riemann Zeroes and Phase Transitions via the Spectral Operator on Fractal Strings
• Weighted percolation on directed networks
• Sample-to-sample fluctuations in real-network ensembles

Cited by in corpus (3)

• Social Climber attachment in forming networks produces phase transition in a measure of connectivity
• Mandala Networks: ultra-robust, ultra-small-world and highly sparse graphs
• Network-ensemble comparisons with stochastic rewiring and von Neumann entropy