Eigenvector-based community detection for identifying information hubs in neuronal networks
Abstract
Eigenvectors of networked systems are known to reveal central, well-connected, network vertices. Here we expand upon the known applications of eigenvectors to define well-connected communities where each is associated with a prominent vertex. This form of community detection provides an analytical approach for analysing the dynamics of information flow in a network. When applied to the neuronal network of the nematode Caenorhabditis elegans, known circuitry can be identified as separate eigenvector-based communities. For the macaques neuronal network, community detection can expose the hippocampus as an information hub; this result contradicts current thinking that the analysis of static graphs cannot reveal such insights. The application of community detection on a large scale human connectome (~1.8 million vertices) reveals the most prominent information carrying pathways present during a magnetic resonance imaging scan. We demonstrate that these pathways can act as an effective unique identifier for a subjects brain by assessing the number of matching pathways present in any two connectomes.\n\nAuthor summaryThe dynamic response of a network to stimulus can be understood by investigating that systems eigenvectors. The eigenvectors highlight the most prominent nodes; those that are either a major source or destination for information in the network. Moreover by defining a coordinate system based on multiple eigenvectors, the most prominent communities can be detected with the most prominent node detected alongside those in the community that funnel information towards it. These methods are applied to a variety of brain networks to highlight the circuitry present in a flatworm (Caenorhabditis elegans), the macaque and human subjects. Static graphs representing the connectomes are analysed to provide insights that were previously believed to only be detectable by numerically modelling information flow. Finally, we discovered that brain networks created for human subjects at different times can be identified as belonging to the same subject by investigating the similarity of the prominent communities.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 2
- 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
- Detecting brain network communities: considering the role of information flow and its different temporal scales
Lazaro M. Sanchez-Rodriguez, Yasser Iturria‐Medina, … Roberto Carlos Sotero·NeuroImagePeer-reviewed·Oct 10, 2020
- Applications of community detection techniques to brain graphs: Algorithmic considerations and implications for neural function
Javier O. Garcia, Arian Ashourvan, … Danielle S. Bassett·Proceedings of the IEEEPeer-reviewed·Feb 1, 2018
- A network-based framework for detecting communities of similar neural spike trains
Indranil Ghosh, Áine Byrne·bioRxiv·Sep 8, 2026
- Comparing Community Detection Methods in Brain Functional Connectivity Networks
Reddy Rani Vangimalla, Jaya Sreevalsan‐Nair·Communications in computer and information sciencePeer-reviewed·Jan 1, 2020
- The Impact of Graph Construction Scheme and Community Detection Algorithm on the Reliability of Community and Hub Identification in Structural Brain Networks
Stavros I. Dimitriadis, Eirini Messaritaki, Derek Kenton Jones·Human Brain MappingPeer-reviewed·Jun 25, 2021
- The diversity and multiplexity of edge communities within and between brain systems
Youngheun Jo, Farnaz Zamani Esfahlani, … Richard F. Betzel·Cell ReportsPeer-reviewed·Nov 1, 2021