Avena-Koenigsberger Andrea, Mišić Bratislav, Hawkins Robert X D, Griffa Alessandra, Hagmann Patric, Goñi Joaquín, Sporns Olaf
Department of Psychological and Brain Sciences, Indiana University, Bloomington, IN, USA.
Department of Psychology, Stanford University, Stanford, CA, USA.
Brain Struct Funct. 2017 Jan;222(1):603-618. doi: 10.1007/s00429-016-1238-5. Epub 2016 Jun 22.
Computational analysis of communication efficiency of brain networks often relies on graph-theoretic measures based on the shortest paths between network nodes. Here, we explore a communication scheme that relaxes the assumption that information travels exclusively through optimally short paths. The scheme assumes that communication between a pair of brain regions may take place through a path ensemble comprising the k-shortest paths between those regions. To explore this approach, we map path ensembles in a set of anatomical brain networks derived from diffusion imaging and tractography. We show that while considering optimally short paths excludes a significant fraction of network connections from participating in communication, considering k-shortest path ensembles allows all connections in the network to contribute. Path ensembles enable us to assess the resilience of communication pathways between brain regions, by measuring the number of alternative, disjoint paths within the ensemble, and to compare generalized measures of path length and betweenness centrality to those that result when considering only the single shortest path between node pairs. Furthermore, we find a significant correlation, indicative of a trade-off, between communication efficiency and resilience of communication pathways in structural brain networks. Finally, we use k-shortest path ensembles to demonstrate hemispherical lateralization of efficiency and resilience.
脑网络通信效率的计算分析通常依赖于基于网络节点间最短路径的图论度量。在此,我们探索一种通信方案,该方案放宽了信息仅通过最优短路径传播的假设。该方案假定一对脑区之间的通信可能通过由这两个区域之间的k条最短路径组成的路径集合来进行。为了探索这种方法,我们在一组源自扩散成像和纤维束成像的解剖学脑网络中绘制路径集合。我们表明,虽然考虑最优短路径会将很大一部分网络连接排除在通信之外,但考虑k条最短路径集合则允许网络中的所有连接都发挥作用。路径集合使我们能够通过测量集合内替代的、不相交路径的数量来评估脑区之间通信路径的弹性,并将路径长度和中介中心性的广义度量与仅考虑节点对之间的单条最短路径时得到的度量进行比较。此外,我们发现结构脑网络中通信效率与通信路径弹性之间存在显著相关性,这表明存在一种权衡。最后,我们使用k条最短路径集合来展示效率和弹性的半球侧化。