IMR Press / JIN / Volume 17 / Issue 2 / DOI: 10.31083/JIN-170049
Open Access Research article
Shortest path based network analysis to characterize cognitive load states of human brain using EEG based functional brain networks
Show Less
1 Computational Neuroscience Laboratory, Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore, Tamil Nadu, 641004, India
2 Department of Computer Science and Software Engineering, Miami University, Oxford, Ohio, 45056, USA
3 Cognitive Neuroengineering Laboratory, School of Information Technology and Mathematical Sciences, Division of IT, Engineering and the Environments, University of South Australia, Adelaide, 5005, South Australia
*Correspondence: ramasav@miamioh.edu (Vijayalakshmi Ramasamy)
J. Integr. Neurosci. 2018, 17(2), 133–148; https://doi.org/10.31083/JIN-170049
Submitted: 30 March 2017 | Accepted: 18 September 2017 | Published: 15 May 2018
Abstract

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.

Keywords
Electroencephalography
functional brain networks
cognition
graph theory
shortest paths
brain's electrical activity
Figures
Fig. 1.
Share
Back to top