Small-world networks are characterized by high clustering coefficient and low characteristic path length. These small-world metrics, particularly the path length, are not meaningful when the graph contains disconnected nodes. To address this issue, we ensured that only small-world metrics computed on connected graphs were considered in our analysis. Specifically, the algorithm used to choose the correlation threshold (R) guaranteed that disconnected graphs were excluded from the analysis. Also, in the node-wise clustering coefficient comparison analysis, we only considered thresholds from 0.1 to 0.6. We chose these thresholds because beyond 0.6 the network gets divided into disconnected subset of nodes.
