Department of Radiology and Hotchkiss Brain Institute, University of Calgary, Calgary, AB, Canada; Department of Neurology and Neurosurgery, Montreal Neurological Institute, McGill Univ., Montreal, Canada; McConnel Brain Imaging Center, Montreal Neurological Institute, McGill Univ., Montreal, Canada; Ludmer Centre for Neuroinformatics and Mental Health, McGill Univ., Montreal, Canada.
Department of Neurology and Neurosurgery, Montreal Neurological Institute, McGill Univ., Montreal, Canada; McConnel Brain Imaging Center, Montreal Neurological Institute, McGill Univ., Montreal, Canada; Ludmer Centre for Neuroinformatics and Mental Health, McGill Univ., Montreal, Canada.
Neuroimage. 2021 Jan 15;225:117431. doi: 10.1016/j.neuroimage.2020.117431. Epub 2020 Oct 10.
The identification of community structure in graphs continues to attract great interest in several fields. Network neuroscience is particularly concerned with this problem considering the key roles communities play in brain processes and functionality. Most methods used for community detection in brain graphs are based on the maximization of a parameter-dependent modularity function that often obscures the physical meaning and hierarchical organization of the partitions of network nodes. In this work, we present a new method able to detect communities at different scales in a natural, unrestricted way. First, to obtain an estimation of the information flow in the network we release random walkers to freely move over it. The activity of the walkers is separated into oscillatory modes by using empirical mode decomposition. After grouping nodes by their co-occurrence at each time scale, k-modes clustering returns the desired partitions. Our algorithm was first tested on benchmark graphs with favorable performance. Next, it was applied to real and simulated anatomical and/or functional connectomes in the macaque and human brains. We found a clear hierarchical repertoire of community structures in both the anatomical and the functional networks. The observed partitions range from the evident division in two hemispheres -in which all processes are managed globally- to specialized communities seemingly shaped by physical proximity and shared function. Additionally, the spatial scales of a network's community structure (characterized by a measure we term within-communities path length) appear inversely proportional to the oscillatory modes' average frequencies. The proportionality constant may constitute a network-specific propagation velocity for the information flow. Our results stimulate the research of hierarchical community organization in terms of temporal scales of information flow in the brain network.
图的社区结构识别在多个领域继续引起极大的兴趣。网络神经科学特别关注这个问题,因为社区在大脑过程和功能中起着关键作用。大多数用于脑图社区检测的方法都是基于最大化依赖参数的模块性函数,而该函数常常掩盖了网络节点划分的物理意义和层次结构组织。在这项工作中,我们提出了一种新的方法,能够以自然、无限制的方式在不同尺度上检测社区。首先,为了获得网络中信息流的估计,我们释放随机游动者在网络上自由移动。通过使用经验模态分解,将游动者的活动分为振荡模式。在对每个时间尺度的节点进行共现分组后,k-模式聚类返回所需的分区。我们的算法首先在基准图上进行了测试,性能良好。接下来,它被应用于猕猴和人类大脑的真实和模拟解剖学和/或功能连接组。我们在解剖学和功能网络中都发现了明显的社区结构层次谱。观察到的分区从两个半球的明显划分(其中所有过程都是全局管理的)到由物理接近性和共享功能塑造的专门社区。此外,网络社区结构的空间尺度(由我们称为社区内路径长度的度量来表征)似乎与振荡模式的平均频率成反比。比例常数可能构成信息流的网络特定传播速度。我们的结果激发了对大脑网络信息流时间尺度的层次社区组织的研究。