Non-random brain connectome wiring enables robust and efficient neural network function under high sparsity
James McAllisteriD, Conor J HoughtoniD, John WadeiD, Cian O’DonnelliD
Abstract
The connectivity of brain networks is extremely sparse due to metabolic, physical and spatial constraints. Although wiring sparsity can confer computational advantages for biological and artificial neural networks, sparse networks require fine parameter tuning and exhibit strong sensitivity to perturbations. How brains achieve their efficiency and robustness is unclear. Here we addressed this by analysing the dynamical properties of Echo State Networks with wiring based on the Drosophila melanogaster fruit fly connectome, compared with sparsity-matched random-wiring networks. We evaluated these networks on a set of eight cognitive tasks, and found that connectome-based neural networks (CoNNs) typically showed narrowly distributed task engagement across their neurons. The importance of a neuron for task performance correlated with its node degree, local clustering, and selfrecurrency, and these correlations were stronger in CoNNs than in random networks. CoNNs were more robust to neuronal loss, retaining their task performance and beneficial dynamical properties such as criticality and spectral radius better than random networks. Similarly, CoNNs were more robust to hyperparameter variations in both input and recurrent weight scaling. Using theoretical arguments and numerical simulations, we show that excess CoNN node self-recurrency is sufficient to explain this enhanced robustness. Overall, these results identify non-random features of connectome wiring that allow brains to reconcile extreme sparsity with reliable computation. SignificanceBrain networks support robust computation even though they operate under extreme wiring sparsity due to metabolic and spatial constraints. While sparse networks typically require fine-tuning and are sensitive to perturbations, we show that biological connectomes support specialised, efficient task engagement and remain robust to neuron loss and parameter variation. We identify excess neuronal selfrecurrency as a key structural feature underlying this stability. These results reveal how non-random connectivity stabilises computation in extremely sparse networks, providing principles for understanding brain function and designing robust, efficient artificial neural systems.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 0
- Organism
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- The impact of sparsity in low-rank recurrent neural networks
Elizabeth Herbert, Srdjan Ostojic·PLoS Computational BiologyPeer-reviewed·Aug 9, 2022
- Human cortical networks trade communication efficiency for computational reliability.
Kayson Fakhar, Danyal Akarca, … Duncan Edward Astle·Science AdvancesPeer-reviewed·Sep 2, 2026
- A Computational Perspective on the No-Strong-Loops Principle in Brain Networks
Fatemeh Hadaeghi, Kayson Fakhar, … Claus Christian Hilgetag·bioRxiv·Sep 24, 2025
- How sparse can a fly-brain model be? Connection strength, wiring placement, network state and task jointly determine function-preserving compression of the Drosophila connectome
Donggyu An·bioRxiv·Sep 25, 2026
- Brain Connectivity meets Reservoir Computing
Fabrizio Damicelli, Claus Christian Hilgetag, Alexandros Goulas·PLoS Computational BiologyPeer-reviewed·Nov 16, 2022
- Weight statistics controls dynamics in recurrent neural networks
Patrick Krauß, Marc Schuster, … Claus Metzner·PLoS ONEPeer-reviewed·Apr 9, 2019