A system is robust if the failure of some of its components doesn’t seriously effect its function (i.e. it fails safe).
In general, robustness depends on which components fail and on the extent of the damage.
Studying robustness: (1) Artificially remove a node to simulate a failure event, (2) analyze how the structure and function of the network changes without that node and all of its links.
We can use graph-connectivity as a proxy for network failure: i.e. if the network remains connected, we can assume that it will likely keep working
Eventually, if all links are removed, the network will simply be a dis-integrated network of singletons

One form of “attack” on a network is to randomly target and delete nodes
Here we show sequence of node deletions and their incident links. 
After just three nodes are deleted (in frame-d), the network breaks into three components disconnected from each other.
Random failure and targeted attack. In a random failure, nodes are chosen randomly for removal.Targeted attack, we will remove nodes based on some criterion, for example, removing nodes in decreasing order of their degree centrality.In order to measure “damage,” we will measure the size of the network’s largest connected component, sometimes called core. First we observe that nx.connected_components is a generator that provides the connected components one at a time, starting with the largest.
G_new = G.copy()random.sample to remove more than one node at at time.Steps of the simulation
Image source: https://wiki.tum.de/display/lfdv/Dropout
Disclaimer: This document is not an original work. It contains content from many sources and is for educational purposes only.