The combined effect of connectivity and dependency links on percolation of networks

DOI10.1007/S10955-011-0333-5MaRDI QIDQ658422zbMATH OpenOpenAlexFDO

Authors Amir Bashan, Shlomo Havlin

Publication date 12 January 2012

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.1631

zbMATH Keywords

networkspercolationcascade of failuresdependency links

Mathematics Subject Classification ID

Percolation (82B43)

Abstract: Percolation theory is extensively studied in statistical physics and mathematics with applications in diverse fields. However, the research is focused on systems with only one type of links, connectivity links. We review a recently developed mathematical framework for analyzing percolation properties of realistic scenarios of networks having links of two types, connectivity and dependency links. This formalism was applied to study Erd$ddoto$s-R$acutee$nyi (ER) networks that include also dependency links. For an ER network with average degree $k$ that is composed of dependency clusters of size $s$, the fraction of nodes that belong to the giant component, $P_{i}nfty$, is given by $P_{i}nfty=p^{s-1}[1-exp(-kp{P}_{i}nfty){]}^s$ where $1-p$ is the initial fraction of randomly removed nodes. Here, we apply the formalism to the study of random-regular (RR) networks and find a formula for the size of the giant component in the percolation process: $P_{i}nfty=p^{s-1}(1-r^k{)}^s$ where $r$ is the solution of $r=p^s(r^{k-1}-1)(1-r^k)+1$. These general results coincide, for $s=1$, with the known equations for percolation in ER and RR networks respectively without dependency links. In contrast to $s=1$, where the percolation transition is second order, for $s>1$ it is of first order. Comparing the percolation behavior of ER and RR networks we find a remarkable difference regarding their resilience. We show, analytically and numerically, that in ER networks with low connectivity degree or large dependency clusters, removal of even a finite number (zero fraction) of the network nodes will trigger a cascade of failures that fragments the whole network. This result is in contrast to RR networks where such cascades and full fragmentation can be triggered only by removal of a finite fraction of nodes in the network.

Recommendations

• The effect of interdependence on the percolation of interdependent networks
• Percolation on coupled networks with multiple effective dependency links
• Percolation of interdependent network of networks
• Percolation of edge-coupled interdependent networks
• Percolation on interacting networks with feedback-dependency links
• Percolation behaviors of partially edge-coupled interdependent networks
• Percolation on complex networks: theory and application
• Percolation behavior analysis of weighted edge-coupled interdependent networks

Cites work

• scientific article; zbMATH DE number 3826957 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 4048834 (Why is no real title available?)
• scientific article; zbMATH DE number 51785 (Why is no real title available?)
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• scientific article; zbMATH DE number 897152 (Why is no real title available?)
• Collective dynamics of `small-world' networks
• Complex networks. Structure, robustness and function.
• Emergence of Scaling in Random Networks
• Generalizations of the Hausdorff dimension of fractal measures.
• Large scale structure and dynamics of complex networks. From information technology to finance and natural science.
• Morphogenesis of spatial networks
• Networks. An introduction.
• Scale-Free Networks
• Sharpness of the phase transition in percolation models
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• The combined effect of connectivity and dependency links on percolation of networks
• The structure and dynamics of networks

Cited in

(15)

• Cascading dynamics with local weighted flow redistribution in interdependent networks
• Analysis of percolation behaviors of clustered networks with partial support-dependence relations
• Percolation of edge-coupled interdependent networks
• Percolation on complex networks: theory and application
• Percolation in spatial networks. Spatial network models beyond nearest neighbours structures
• Percolation on interacting networks with feedback-dependency links
• Robustness on interdependent networks with a multiple-to-multiple dependent relationship
• A study on the relationship between connecting different types of nodes and disassortativity by degree
• The combined effect of connectivity and dependency links on percolation of networks
• Failure cascade in interdependent network with traffic loads
• Explosive synchronization coexists with classical synchronization in the Kuramoto model
• Minimal functional routes in directed graphs with dependent edges
• Percolation of interdependent network of networks
• Resilience of networks formed of interdependent modular networks
• Percolation behavior analysis of weighted edge-coupled interdependent networks

This page was built for publication: The combined effect of connectivity and dependency links on percolation of networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658422)