Fig. 5From: Robustness of preferential-attachment graphsThe expected robustness score of networks drawn from \(\textsf {G}(n,m,k)\) normalized by the maximum achievable robustness score when \(\beta \in \{0, 0.01,\dots , 0.99, 1\}\) fraction of the vertices are removed by adaptive targeted attacks, non-adaptive targeted attacks, or random failures. Here, we consider \(m=nk\) for each fixed pair of n and k where \(n\in \{1000, 10{,}000, 20{,}000\}\) and \(k\in \{3,4,5\}\)Back to article page