Fragmentation properties of two-dimensional Proximity Graphs considering random failures and targeted attacks

Abstract

The pivotal quality of proximity graphs is connectivity, i.e. all nodes in the graph are connected to one another either directly or via intermediate nodes. These types of graphs are robust, i.e., they are able to function well even if they are subject to limited removal of elementary building blocks, as it may occur for random failures or targeted attacks. Here, we study how the structure of these graphs is affected when nodes get removed successively until an extensive fraction is removed such that the graphs fragment. We study different types of proximity graphs for various node removal strategies. We use different types of observables to monitor the fragmentation process, simple ones like number and sizes of connected components, and more complex ones like the hop diameter and the backup capacity, which is needed to make a network N-1 resilient. The actual fragmentation turns out to be described by a second order phase transition. Using finite-size scaling analyses we numerically assess the threshold fraction of removed nodes, which is characteristic for the particular graph type and node deletion scheme, that suffices to decompose the underlying graphs.

12 pages, 9 figures

References in corpus (7)

• Cascade control and defense in complex networks
• Analysis of a power grid using the Kuramoto-like model
• Robustness of interdependent networks under targeted attack
• Proximity Networks and Epidemics
• Percolation thresholds on 2D Voronoi networks and Delaunay triangulations
• Large-deviation properties of resilience of transportation networks
• Percolation thresholds on planar Euclidean relative neighborhood graphs

Cited by in corpus (8)

• Large-deviation properties of the largest biconnected component for random graphs
• Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks
• Collective effects of the cost of opinion change
• Critical behaviors of high-degree adaptive and collective-influence percolation
• Explosive dismantling of two-dimensional random lattices under betweenness centrality attacks
• Vulnerable Connectivity Caused by Local Communities in Spatial Networks
• Large deviations of connected components in the stochastic block model
• A machine learning procedure to detect network attacks