Fig 3. Minimum path length and the clustering coefficient.

We estimate the average of the minimum path length and the clustering coefficient for threshold values r_c. The topological network structure is obtained by the condition a_ij = 1 if |w_ij| > r_c for each matrix data. Then the average is taken for whole datasets, 986 functional connectome datasets [9, 15]. A The Average of the minimum path length. For L_ij the minimum path length between i and j nodes, we estimate the average $<L>=\frac{1}{N(N-1)}{\sum }_{i\ne j}{L}_{ij}$ with all pairs of nodes in each graph. For unconnected node pairs, which have no connected path, L_ij are substituted by the total number of nodes. B The clustering coefficient. The clustering coefficient measures the probability that the adjacent vertices of a vertex are connected. C Changes of the clustering coefficient. We show the changes of the clustering coefficient along the threshold with ΔC = C(i) − C(i + 1), where i indicates the value at r_c = 0.1 × i threshold.