The impact of graph construction scheme and community detection algorithm on the repeatability of community and hub identification in structural brain networks.

A critical question in network neuroscience is how nodes cluster together to form communities, to form the mesoscale organisation of the brain. Various algorithms have been proposed for identifying such communities, each identifying different communities within the same network. Here, (using test-retest data from the Human Connectome Project), the repeatability of thirty-three community detection algorithms, each paired with seven different graph construction schemes were assessed. Repeatability of community partition depended heavily on both the community detection algorithm and graph construction scheme. Hard community detection algorithms (in which each node is assigned to only one community) outperformed soft ones (in which each node can belong to more than one community). The highest repeatability was observed for the fast multi-scale community detection algorithm paired with a graph construction scheme that combines nine white matter metrics. This pair also gave the highest similarity between representative group community affiliation and individual community affiliation. Connector hubs had higher repeatability than provincial hubs. Our results provide a workflow for repeatable identification of structural brain networks communities, based on the optimal pairing of community detection algorithm and graph construction scheme.