Related papers: Optimization of Network Robustness to Waves of Tar…
Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random…
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…
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…
The stability of networks is greatly influenced by their degree distributions and in particular by their broadness. Networks with broader degree distributions are usually more robust to random failures but less robust to localized attacks.…
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…
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…
We developed a scheme for evaluating the size of the largest connected subnetwork (giant component) in random networks and the percolation threshold when sites (nodes) and/or bonds (edges) are removed from the networks based on the cavity…
The existence of inter-dependence between multiple networks imparts an additional scale of complexity to such systems often referred to as `network of networks' (NON). We have investigated the robustness of NONs to random breakdown of their…
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…
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…
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…
We investigate certain structural properties of random interdependent networks. We start by studying a property known as $r$-robustness, which is a strong indicator of the ability of a network to tolerate structural perturbations and…
In this work, we consider two types of adversarial attacks on a network of nodes seeking to reach consensus. The first type involves an adversary that is capable of breaking a specific number of links at each time instant. In the second…
We investigate the robustness of random networks reinforced by adding hidden edges against targeted attacks. This study focuses on two types of reinforcement: uniform reinforcement, where edges are randomly added to all nodes, and selective…
We present exact analysis of the physical properties of bimodal networks specified by the two peak degree distribution fully incorporating the degree-degree correlation between node connection. The structure of the correlated bimodal…
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…
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…
We consider optimal attacks or immunization schemes on different models of random graphs. We derive bounds for the minimum number of nodes needed to be removed from a network such that all remaining components are fragments of negligible…
When an initial failure of nodes occurs in interdependent networks, a cascade of failure between the networks occurs. Earlier studies focused on random initial failures. Here we study the robustness of interdependent networks under targeted…
There has been a considerable amount of interest in recent years on the robustness of networks to failures. Many previous studies have concentrated on the effects of node and edge removals on the connectivity structure of a static network;…