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 constant. We find that when < k >= 3 the robustness of the scale-free networks reach its maximum value if the minimal connectivity m = 1 , but when < k > is larger than four, the networks will become more robust to random failures and targeted attacks as the minimal connectivity m gets larger.
منابع مشابه
On the influence of topological characteristics on robustness of complex networks
In this paper, we explore the relationship between the topological characteristics of a complex network and its robustness to sustained targeted attacks. Using synthesised scale-free, smallworld and random networks, we look at a number of network measures, including assortativity, modularity, average path length, clustering coefficient, rich club profiles and scale-free exponent (where applicab...
متن کاملRobustness in a space of complex networks
Models of complex networks have various properties which can be measured in real networks (WWW, social networks, biological networks), e.g. degree distribution, modularity, hierarchy, assortativity etc. Determining how robust these models are could have important implications for real-world network stability, but this direction of research has seen only some progress. For example, it was shown ...
متن کاملRobustness of onion-like correlated networks against targeted attacks
Recently, it was found by Schneider et al. [Proc. Natl. Acad. Sci. USA 108, 3838 (2011)], using simulations, that scale-free networks with "onion structure" are very robust against targeted high degree attacks. The onion structure is a network where nodes with almost the same degree are connected. Motivated by this work, we propose and analyze, based on analytical considerations, an onionlike c...
متن کاملOptimization of the robustness of multimodal networks.
We investigate the robustness against both random and targeted node removal of networks in which P(k), the distribution of nodes with degree k, is a multimodal distribution, [formula--see text] with k(i) proportional to b -(i-1) and Dirac's delta function delta (x). We refer to this type of network as a scale-free multimodal network. For m=2, the network is a bimodal network; in the limit m app...
متن کاملRobustness of networks against propagating attacks under vaccination strategies
Abstract. We study the effect of vaccination on robustness of networks against propagating attacks that obey the susceptible-infected-removed model. By extending the generating function formalism developed by Newman (2005), we analytically determine the robustness of networks that depends on the vaccination parameters. We consider the random defense where nodes are vaccinated randomly and the d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005