首页> 美国卫生研究院文献>PLoS Clinical Trials >Statistics of Weighted Brain Networks Reveal Hierarchical Organization and Gaussian Degree Distribution
【2h】

Statistics of Weighted Brain Networks Reveal Hierarchical Organization and Gaussian Degree Distribution

机译:加权脑网络的统计数据揭示了层次结构和高斯分布

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。
获取外文期刊封面目录资料

摘要

Whole brain weighted connectivity networks were extracted from high resolution diffusion MRI data of 14 healthy volunteers. A statistically robust technique was proposed for the removal of questionable connections. Unlike most previous studies our methods are completely adapted for networks with arbitrary weights. Conventional statistics of these weighted networks were computed and found to be comparable to existing reports. After a robust fitting procedure using multiple parametric distributions it was found that the weighted node degree of our networks is best described by the normal distribution, in contrast to previous reports which have proposed heavy tailed distributions. We show that post-processing of the connectivity weights, such as thresholding, can influence the weighted degree asymptotics. The clustering coefficients were found to be distributed either as gamma or power-law distribution, depending on the formula used. We proposed a new hierarchical graph clustering approach, which revealed that the brain network is divided into a regular base-2 hierarchical tree. Connections within and across this hierarchy were found to be uncommonly ordered. The combined weight of our results supports a hierarchically ordered view of the brain, whose connections have heavy tails, but whose weighted node degrees are comparable.
机译:从14名健康志愿者的高分辨率扩散MRI数据中提取了全脑加权连接网络。提出了一种统计上可靠的技术来删除有问题的连接。与以前的大多数研究不同,我们的方法完全适用于具有任意权重的网络。计算了这些加权网络的常规统计数据,发现它们与现有报告具有可比性。经过使用多个参数分布的鲁棒拟合过程后,发现我们网络的加权节点度最好用正态分布来描述,这与以前的报告中提出的重尾分布相反。我们表明,连接权重的后处理(例如阈值设置)会影响加权度渐近性。根据所使用的公式,发现聚类系数以伽马或幂律分布的形式分布。我们提出了一种新的层次图聚类方法,该方法揭示了大脑网络被分为规则的以2为底的层次树。发现该层次结构内部和整个层次之间的连接不常见。我们的结果的综合权重支持大脑的层次结构视图,其连接具有沉重的尾巴,但其加权结点程度是可比的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号