Table 2 For each fixed combination of n and k, we generate three clusters of networks, as described at the beginning of “Experiments” section. Then, for each fixed \(\beta \in \{0.05, 0.1, 0.2, 0.25, 0.3, 0.4\}\), we compute a silhouette score for the three corresponding groups, using the same procedure that we used to obtain the values in Table 1

From: Robustness of preferential-attachment graphs