Quantitative descriptions of network structure can provide fundamental insights into the function of interconnected complex systems. Small-world structure, diagnosed by high local clustering yet short average path length between any two nodes, promotes information flow in coupled systems, a key function that can differ across conditions or between groups. However, current techniques to quantify small-worldness are density dependent and neglect important features such as the strength of network connections, limiting their application in real-world systems. Here, we address both limitations with a novel metric called the Small-World Propensity (SWP). In its binary instantiation, the SWP provides an unbiased assessment of small-world structure in networks of varying densities. We extend this concept to the case of weighted brain networks by developing (i) a standardized procedure for generating weighted small-world networks, (ii) a weighted extension of the SWP, and (iii) a method for mapping observed brain network data onto the theoretical model. In applying these techniques to compare real-world brain networks, we uncover the surprising fact that the canonical biological small-world network, the C. elegans neuronal network, has strikingly low SWP. These metrics, models, and maps form a coherent toolbox for the assessment and comparison of architectural properties in brain networks.

Clustering is concerned with coherently grouping observations without any explicit concept of true groupings. Spectral graph clustering—clustering the vertices of a graph based on their spectral embedding—is commonly approached viaK-means (or, more generally, Gaussian mixture model) clustering composed with either Laplacian spectral embedding (LSE) or adjacency spectral embedding (ASE). Recent theoretical results provide deeper understanding of the problem and solutions and lead us to a “two-truths” LSE vs. ASE spectral graph clustering phenomenon convincingly illustrated here via a diffusion MRI connectome dataset: The different embedding methods yield different clustering results, with LSE capturing left hemisphere/right hemisphere affinity structure and ASE capturing gray matter/white matter core–periphery structure.

No abstract

Replicability, the ability to replicate scientific findings, is a prerequisite for scientific discovery and clinical utility. Troublingly, we are in the midst of a replicability crisis. A key to replicability is that multiple measurements of the same item (e.g., experimental sample or clinical participant) under fixed experimental constraints are relatively similar to one another. Thus, statistics that quantify the relative contributions of accidental deviations—such as measurement error—as compared to systematic deviations—such as individual differences—are critical. We demonstrate that existing replicability statistics, such as intra-class correlation coefficient and fingerprinting, fail to adequately differentiate between accidental and systematic deviations in very simple settings. We therefore propose a novel statistic, discriminability, which quantifies the degree to which an individual’s samples are relatively similar to one another, without restricting the data to be univariate, Gaussian, or even Euclidean. Using this statistic, we introduce the possibility of optimizing experimental design via increasing discriminability and prove that optimizing discriminability improves performance bounds in subsequent inference tasks. In extensive simulated and real datasets (focusing on brain imaging and demonstrating on genomics), only optimizing data discriminability improves performance on all subsequent inference tasks for each dataset. We therefore suggest that designing experiments and analyses to optimize discriminability may be a crucial step in solving the replicability crisis, and more generally, mitigating accidental measurement error.