Thilaga M, Ramasamy Vijayalakshmi, Nadarajan R, Nandagopal D
Computational Neuroscience Laboratory, Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, Tamil Nadu, India.
Department of Computer Science and Software Engineering, Miami University, Oxford, Ohio, USA.
J Integr Neurosci. 2018;17(2):133-148. doi: 10.31083/JIN-170049.
Understanding and analyzing the dynamic interactions among millions of spatially distributed and functionally connected regions in the human brain constituting a massively parallel communication system is one of the major challenges in computational neuroscience. Many studies in the recent past have employed graph theory to efficiently model, quantitatively analyze, and understand the brain’s electrical activity. Since, the human brain is believed to broadcast information with reduced material and metabolic costs, identifying various brain regions in the shortest pathways of information dissemination becomes essential to understand the intricacies of brain function. This paper proposes a graph theoretic approach using the concept of shortest communication paths between various brain regions (electrode sites) to identify the significant communication pathways of information exchange between various nodes in the functional brain networks constructed from multi-channel electroencephalograph data. A special weighted network called the Shortest Path Network is constructed from a functional brain network where the edge weight is computed as the sum of frequency of occurrence of that edge in all possible shortest paths between every pair of electrodes. The weighted Shortest Path Networks thus constructed portray information on the number of times the edges are used in information propagation during different cognitive states. This network is further analyzed by computing the influential communication paths to characterize the information dissemination among brain regions during different cognitive load conditions. The experimental results presented demonstrate the efficacy of this novel graph theoretic approach in identifying, quantifying, and comparing the significant shortest pathways of information exchange during mild and heavy cognitive load conditions. Analysis also suggests that future research should consider the biological inferences of the ability of the human brain to use reduced material and metabolic cost during the instantaneous transmission of information.
理解和分析构成大规模并行通信系统的人类大脑中数百万个空间分布且功能相连的区域之间的动态相互作用,是计算神经科学的主要挑战之一。最近的许多研究都采用图论来有效地建模、定量分析和理解大脑的电活动。由于人们认为人类大脑以降低的物质和代谢成本来传播信息,因此在信息传播的最短路径中识别各种脑区对于理解脑功能的复杂性至关重要。本文提出了一种图论方法,利用各种脑区(电极位点)之间最短通信路径的概念,来识别从多通道脑电图数据构建的功能性脑网络中各个节点之间信息交换的重要通信路径。一种特殊的加权网络,即最短路径网络,是从功能性脑网络构建的,其中边权重计算为该边在每对电极之间所有可能最短路径中出现频率的总和。如此构建的加权最短路径网络描绘了在不同认知状态下信息传播过程中边被使用次数的信息。通过计算有影响力的通信路径对该网络进行进一步分析,以表征在不同认知负荷条件下脑区之间的信息传播。所呈现的实验结果证明了这种新颖的图论方法在识别、量化和比较轻度和重度认知负荷条件下信息交换的重要最短路径方面的有效性。分析还表明,未来的研究应该考虑人类大脑在信息瞬时传输过程中使用降低的物质和代谢成本这一能力的生物学推断。