Shortest-path percolation on scale-free networks

Abstract

The shortest-path percolation (SPP) model aims at describing the consumption and eventual exhaustion of a network's resources. Starting from a network containing a macroscopic connected component, random pairs of nodes are sequentially selected, and if the length of the shortest path connecting the node pairs is smaller than a tunable budget parameter, then all edges along such a path are removed from the network. As edges are progressively removed, the network eventually breaks into multiple microscopic components, undergoing a percolation-like transition. It is known that SPP transition on Erdős-Rényi networks (ERNs) belongs to same universality class as of the ordinary bond percolation if the budget parameter is finite; for unbounded budget, instead, the SPP transition becomes more abrupt than the ordinary percolation transition. By means of large-scale numerical simulations and finite-size scaling analysis, here we study the SPP transition on random scale-free networks (SFNs) characterized by power-law degree distributions. We find, in contrast with ordinary percolation, that the transition is identical to the one observed on ERNs, denoting independence from the degree exponent. Still, we distinguish finite- and infinite-budget SPP universality classes. Our findings follow from the fact that the SPP process drastically homogenizes the heterogeneous structure of SFNs before the SPP transition takes place.

References in corpus (25)

• Catastrophic cascade of failures in interdependent networks
• Who is the best connected scientist? A study of scientific coauthorship networks
• Critical phenomena in complex networks
• Universal Behavior of Load Distribution in Scale-free Networks
• Generation of uncorrelated random scale-free networks
• Betweenness Centrality in Large Complex Networks
• Robustness and resilience of complex networks
• Percolation on complex networks: Theory and application
• Percolation Critical Exponents in Scale-Free Networks
• "Explosive Percolation" Transition is Actually Continuous
• Explosive percolation in scale-free networks
• Percolation Transitions in Scale-Free Networks under Achlioptas Process
• Explosive percolation: a numerical analysis
• The dynamic nature of percolation on networks with triadic interactions
• Breaking of the site-bond percolation universality in networks
• Message passing methods on complex networks
• Explosive Percolation Obeys Standard Finite-Size Scaling in an Event-based Ensemble
• Path Percolation in Quantum Communication Networks
• Shortest-path percolation on random networks
• Extended-range percolation in complex networks
• Explosive percolation in finite dimensions
• General theory for extended-range percolation on simple and multiplex networks
• Scaling and universality for percolation in random networks: A unified view
• Finite-size scaling of percolation on scale-free networks
• Modeling resource consumption in the US air transportation system via minimum-cost percolation