Fig. 9

Histograms of the average increase in robustness for high and low changes in one topological metric. We take 500 random networks that have full demand satisfaction and some robustness. For each combination of a network and an edge that is not in the network, we compute r, motif signature, and three-node subgraph counts. Then, for each network, we separate combinations into two groups: the ones that yield the highest increase in a simple metric (counts of feedforward loop (a), z-score of feedforward loop (b), and \(\sigma\) (c))—denoted as high, and the remaining combinations—denoted as low. After this we compare the average increase in r in these two groups