Related papers: Optimization of Robustness of Complex Networks
We study the robustness of complex networks to multiple waves of simultaneous (i) targeted attacks in which the highest degree nodes are removed and (ii) random attacks (or failures) in which fractions $p_t$ and $p_r$ respectively of the…
In varying degree distributions, we investigate the optimally robust networks against targeted attacks to nodes with higher degrees. In considering that a network tends to have more robustness with a smaller variance of degree…
It has been found that the networks with scale-free distribution are very resilient to random failures. The purpose of this work is to determine the network design guideline which maximize the network robustness to random failures with the…
A central issue in complex networks is tolerance to random failures and intentional attacks. Current literature emphasizes the dichotomy between networks with a power-law node connectivity distribution, which are robust to random failures…
Many networks are characterized by highly heterogeneous distributions of links, which are called scale-free networks and the degree distributions follow $p(k)\sim ck^{-\alpha}$. We study the robustness of scale-free networks to random…
The scale-fee networks, having connectivity distribution $P(k)\sim k^{-\alpha}$ (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…
With increasingly ambitious initiatives such as GENI and FIND that seek to design the future Internet, it becomes imperative to define the characteristics of robust topologies, and build future networks optimized for robustness. This paper…
In this paper, we present algorithms for designing networks that are robust to node failures with minimal or limited number of links. We present algorithms for both the static network setting and the dynamic network setting; setting where…
In a recent work [Proc. Natl. Acad. Sci. USA 108, 3838 (2011)], the authors proposed a simple measure for network robustness under malicious attacks on nodes. With a greedy algorithm, they found the optimal structure with respect to this…
Strengthening or destroying a network is a very important issue in designing resilient networks or in planning attacks against networks including planning strategies to immunize a network against diseases, viruses etc.. Here we develop a…
The inverse problem of finding the optimal network structure for a specific type of dynamical process stands out as one of the most challenging problems in network science. Focusing on the susceptible-infected-susceptible type of dynamics…
Generally, networks are classified into two sides of inequality and equality with respect to the number of links at nodes by the types of degree distributions. One side includes many social, technological, and biological networks which…
In a recent work [Proc. Natl. Acad. Sci. USA 108, 3838 (2011)], Schneider et al. proposed a new measure for network robustness and investigated optimal networks with respect to this quantity. For networks with a power-law degree…
We study network configurations that provide optimal robustness to random breakdowns for networks with a given number of nodes $N$ and a given cost--which we take as the average number of connections per node $\kav$. We find that the…
It is often claimed that the entropy of a network's degree distribution is a proxy for its robustness. Here, we clarify the link between degree distribution entropy and giant component robustness to node removal by showing that the former…
We study the robustness properties of multiplex networks consisting of multiple layers of distinct types of links, focusing on the role of correlations between degrees of a node in different layers. We use generating function formalism to…
We study the resilience of complex networks against attacks in which nodes are targeted intelligently, but where disabling a node has a cost to the attacker which depends on its degree. Attackers have to meet these costs with limited…
We study the detailed mechanism of the failure of scale-free networks under intentional attacks. Although it is generally accepted that such networks are very sensitive to targeted attacks, we show that for a particular type of structure…
Recent work on the internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes. Such deletions include, for example, the failure of internet routers or…
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…