“…The networks differed in the number of edges (i.e., correlation matrix) (Wen et al, 2011; Shen et al, 2015). Thus, we applied a range of sparsity thresholds, defined as the fraction of the total number of edges remaining in a network, so every graph had the same number of edges (Watts and Strogatz, 1998; Wen et al, 2011; Shen et al, 2015; Suo et al, 2015). The minimum sparsity was set so that the averaged node degree of the network with threshold was 2log( N ), where N was the number of nodes, and the small-worldness scalar of the network was >1.1 (Wen et al, 2011; Shen et al, 2015; Suo et al, 2015).…”