arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1604.01680q-bio.NC
收藏

EEG功能连接的复杂层次拓扑

The Complex Hierarchical Topology of EEG Functional Connectivity

Keith Smith, Javier Escudero

摘要:

了解复杂的功能性脑网络的层次拓扑结构是功能连接研究的一个关键方面。稀疏二进制网络模型的广泛使用掩盖了这些主题,稀疏二进制网络模型与从功能连接导出的完整加权网络有着根本的不同。我们介绍了两种技术来探测拓扑的层次复杂性。首先,提出了一种新的度量层次复杂性的方法,其次,提出了一种加权复杂层次模型。为了彻底评估我们的技术,我们将稀疏二进制网络原型推广到加权形式,并使用密度曲线探索大脑网络的主要拓扑特征-集成,规则性和模块化。通过控制我们的模型的参数,最高的复杂性之间出现的随机拓扑结构和严格的“类为基础的”拓扑结构。此外,该模型在峰值性能时具有与EEG相位滞后网络相当的复杂度。层次复杂性比以前常用的复杂性度量在不同网络之间获得更大的幅度和范围的差异,并且我们的WCH模型在全范围的密度下提供了比标准无标度和小世界模型更广泛的网络拓扑结构。我们的度量标准和模型提供了严格的表征层次复杂性。重要的是,我们的框架显示了一个规模的复杂性之间产生的“所有节点都是平等的”拓扑结构在一个极端和“严格的基于类的”拓扑结构在其他。

英文摘要:

Understanding the complex hierarchical topology of functional brain networks is a key aspect of functional connectivity research. Such topics are obscured by the widespread use of sparse binary network models which are fundamentally different to the complete weighted networks derived from functional connectivity. We introduce two techniques to probe the hierarchical complexity of topologies. Firstly, a new metric to measure hierarchical complexity; secondly, a Weighted Complex Hierarchy (WCH) model. To thoroughly evaluate our techniques, we generalise sparse binary network archetypes to weighted forms and explore the main topological features of brain networks- integration, regularity and modularity- using curves over density. By controlling the parameters of our model, the highest complexity is found to arise between a random topology and a strict 'class-based' topology. Further, the model has equivalent complexity to EEG phase-lag networks at peak performance. Hierarchical complexity attains greater magnitude and range of differences between different networks than the previous commonly used complexity metric and our WCH model offers a much broader range of network topology than the standard scale-free and small-world models at a full range of densities. Our metric and model provide a rigorous characterisation of hierarchical complexity. Importantly, our framework shows a scale of complexity arising between 'all nodes are equal' topologies at one extreme and 'strict class-based' topologies at the other.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑