...
首页> 外文期刊>Scientific reports. >Hierarchical organization of functional connectivity in the mouse brain: a complex network approach
【24h】

Hierarchical organization of functional connectivity in the mouse brain: a complex network approach

机译:鼠标大脑中功能连接的层次结构:复杂的网络方法

获取原文
   

获取外文期刊封面封底 >>

       

摘要

This paper represents a contribution to the study of the brain functional connectivity from the perspective of complex networks theory. More specifically, we apply graph theoretical analyses to provide evidence of the modular structure of the mouse brain and to shed light on its hierarchical organization. We propose a novel percolation analysis and we apply our approach to the analysis of a resting-state functional MRI data set from 41 mice. This approach reveals a robust hierarchical structure of modules persistent across different subjects. Importantly, we test this approach against a statistical benchmark (or null model) which constrains only the distributions of empirical correlations. Our results unambiguously show that the hierarchical character of the mouse brain modular structure is not trivially encoded into this lower-order constraint. Finally, we investigate the modular structure of the mouse brain by computing the Minimal Spanning Forest, a technique that identifies subnetworks characterized by the strongest internal correlations. This approach represents a faster alternative to other community detection methods and provides a means to rank modules on the basis of the strength of their internal edges.
机译:本文代表了从复杂网络理论的角度对大脑功能连通性研究的贡献。更具体地说,我们应用图论分析来提供鼠标大脑模块结构的证据并阐明其层次结构。我们提出了一种新颖的渗流分析,并将我们的方法应用于对来自41只小鼠的静止状态功能MRI数据集的分析。这种方法揭示了跨不同主题持久性存在的模块的稳健层次结构。重要的是,我们对照统计基准(或空模型)测试此方法,该统计基准仅约束经验相关性的分布。我们的结果清楚地表明,鼠标大脑模块化结构的分层特征并未被微不足道地编码到此低阶约束中。最后,我们通过计算最小生成林(Minimum Spanning Forest)来研究鼠标大脑的模块化结构,该技术可识别以最强内部相关性为特征的子网。此方法代表了其他社区检测方法的更快替代方法,并提供了一种基于模块内部边缘强度对模块进行排名的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号