Related papers: Optimal cost for strengthening or destroying a giv…

Dismantling criminal networks or containing epidemics or misinformation through node removal is a well-studied problem. To evaluate the effectiveness of such efforts, one must measure the strength of the network before and after node…

We study a Stackelberg variant of the classical Most Vital Links problem, modeled as a one-round adversarial game between an attacker and a defender. The attacker strategically removes up to $k$ edges from a flow network to maximally…

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…

Centrality measures such as the degree, k-shell, or eigenvalue centrality can identify a network's most influential nodes, but are rarely usefully accurate in quantifying the spreading power of the vast majority of nodes which are not…

The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability…

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. study scale-free networks including some which approximate the measured degree distribution of the Internet.…

Robustness is pivotal for comprehending, designing, optimizing, and rehabilitating networks, with simulation attacks being the prevailing evaluation method. Simulation attacks are often time-consuming or even impractical, however, a more…

While gradient descent has proven highly successful in learning connection weights for neural networks, the actual structure of these networks is usually determined by hand, or by other optimization algorithms. Here we describe a simple…

After a failure or attack the structure of a complex network changes due to node removal. Here, we show that the degree distribution of the distorted network, under any node disturbances, can be easily computed through a simple formula.…

We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution…

We describe a new method for the random sampling of connected networks with a specified degree sequence. We consider both the case of simple graphs and that of loopless multigraphs. The constraints of fixed degrees and of connectedness are…

We describe a procedure that allows continuously tuning the average degree $\langle k \rangle$ of uncorrelated networks with power-law degree distribution $p(k)$. Inn order to do this, we modify the low-$k$ region of $p(k)$, while…

A practical approach to protecting networks against epidemic processes such as spreading of infectious diseases, malware, and harmful viral information is to remove some influential nodes beforehand to fragment the network into small…

The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively and linking each to an earlier node of degree k with attachment probability A_k. When A_k grows slower…

The structure of the network has great impact on its traffic dynamics. Most of the real world networks follow the heterogeneous structure and exhibit scale-free feature. In scale-free network, a new node prefers to connect with hub nodes…

We consider the problem of self-healing in networks that are reconfigurable in the sense that they can change their topology during an attack. Our goal is to maintain connectivity in these networks, even in the presence of repeated…

The ever-increasing knowledge of the structure of various real-world networks has uncovered their complex multi-mechanism-governed evolution processes. Therefore, a better understanding of the structure and evolution of these networked…

Traditional network disruption approaches focus on disconnecting or lengthening paths in the network. We present a new framework for network disruption that attempts to reroute flow through critical vertices via vertex deletion, under the…

In the understanding of important edges in complex networks, the edges with larger degree are naturally considered more important, and they will cause greater destructiveness when attacked. However, through simulation analysis, we conclude…

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…