Hierarchical scale-free network is fragile against random failure.
نویسندگان
چکیده
We investigate site percolation in a hierarchical scale-free network known as the Dorogovtsev-Goltsev-Mendes network. We use the generating function method to show that the percolation threshold is 1, i.e., the system is not in the percolating phase when the occupation probability is less than 1. The present result is contrasted to bond percolation in the same network of which the percolation threshold is zero. We also show that the percolation threshold of intentional attacks is 1. Our results suggest that this hierarchical scale-free network is very fragile against both random failure and intentional attacks. Such a structural defect is common in many hierarchical network models.
منابع مشابه
Optimization of Robustness of Scale-free Network to Random and Targeted Attacks
The scale-fee networks, having connectivity distribution P (k) ∼ k−α (where k is the site connectivity), is very resilient to random failures but fragile to intentional attack. The purpose of this paper is to find the network design guideline which can make the robustness of the network to both random failures and intentional attack maximum while keeping the average connectivity < k > per node ...
متن کاملThe robust-yet-fragile nature of interdependent networks
Interdependent networks have been shown to be extremely vulnerable based on the percolation model. Parshani et. al further indicated that the more inter-similar networks are, the more robust they are to random failure. Our understanding of how coupling patterns shape and impact the cascading failures of loads in interdependent networks is limited, but is essential for the design and optimizatio...
متن کاملCritical connectivity in banking networks ∗
The financial crisis of 2007-2009 demonstrated the need to understand the macrodynamics of interconnected financial systems. A fruitful approach to this problem regards financial infrastructures as weighted directed networks, with banks as nodes and loans as links. Using a simple banking model in which banks are linked through interbank lending, with an exogenous shock applied to a single bank,...
متن کاملSnapShot: Protein-Protein Interaction Networks
Degree/ connectivity (k) k A =Nb of edges through A=5 B 4 =Fraction of SPs passing through A =0.090 Assortativity/average nearest neighbor's connectivity (NC) Shortest path (SP) between two nodes Betweenness/ centrality (B) Clustering coefficient/ interconnectivity (C) C A = Actual links between A's neighbors (black) Possible links between A's neighbors (orange) A D-Degrees follow Poisson (or p...
متن کاملRobustness of cooperation on scale-free networks under continuous topological change
In this paper, we numerically investigate the robustness of cooperation clusters in prisoner's dilemma played on scale-free networks, where the network topologies change by continuous removal and addition of nodes. Each removal and addition can be either random or intentional. We therefore have four different strategies in changing network topology: random removal and random addition (RR), rand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 88 6 شماره
صفحات -
تاریخ انتشار 2013