Communities in C.elegans connectome through the prism of non-backtracking walks

TL;DR

This paper introduces a non-backtracking walk approach to detect community structures in the sparse C.elegans connectome, outperforming traditional spectral methods and accurately identifying 10 modules aligned with biological data.

Contribution

It presents a novel non-backtracking walk method for community detection in sparse neural networks, improving accuracy over traditional spectral techniques.

Findings

Non-backtracking walks resolve community structures in sparse connectomes.

Optimal number of modules in C.elegans connectome is 10.

Method aligns with biological annotations and spectral eigenvalues.

Abstract

The fundamental relationship between the mesoscopic structure of neuronal circuits and organismic functions they subserve is one of the major challenges in contemporary neuroscience. Formation of structurally connected modules of neurons enacts the conversion from single-cell firing to large-scale behaviour of an organism, highlighting the importance of their accurate profiling in the data. While connectomes are typically characterized by significant sparsity of neuronal connections, recent advances in network theory and machine learning have revealed fundamental limitations of traditionally used community detection approaches in cases where the network is sparse. Here we studied the optimal community structure in the structural connectome of C.elegans, for which we exploited a non-conventional approach that is based on non-backtracking random walks, virtually eliminating the sparsity issue. In full agreement with the previous asymptotic results, we demonstrated that non-backtracking walks resolve the ground truth annotation into clusters on stochastic block models (SBM) with the size and density of the connectome better than the spectral methods related to simple random walks. Based on the cluster detectability threshold, we determined that the optimal number of modules in a recently mapped connectome of C.elegans is 10, which precisely corresponds to the number of isolated eigenvalues in the spectrum of the non-backtracking flow matrix. Broadly, our work provides a robust network-based framework to reveal mesoscopic structures in sparse connectomic datasets, paving way to further investigation of connectome mechanisms for different functions.