Volume entropy for modeling information flow in a brain graph.
Ontology highlight
ABSTRACT:
SUBMITTER: Lee H
PROVIDER: S-EPMC6342973 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Exponential random graph models (ERGMs), also known as p* models, have been utilized extensively in the social science literature to study complex networks and how their global structure depends on underlying structural components. However, the literature on their use in biological networks (especially brain networks) has remained sparse. Descriptive models based on a specific feature of the graph (clustering coefficient, degree distribution, etc.) have dominated connectivity research in neuroscience. Corresponding generative models have been developed to reproduce one of these features. However, the complexity inherent in whole-brain network data necessitates the development and use of tools that allow the systematic exploration of several features simultaneously and how they interact to form the global network architecture. ERGMs provide a statistically principled approach to the assessment of how a set of interacting local brain network features gives rise to the global structure. We illustrate the utility of ERGMs for modeling, analyzing, and simulating complex whole-brain networks with network data from normal subjects. We also provide a foundation for the selection of important local features through the implementation and assessment of three selection approaches: a traditional p-value based backward selection approach, an information criterion approach (AIC), and a graphical goodness of fit (GOF) approach. The graphical GOF approach serves as the best method given the scientific interest in being able to capture and reproduce the structure of fitted brain networks.
| S-EPMC3102079 | biostudies-other
Project description:Neurophysiological measurements suggest that human information processing is evinced by neuronal activity. However, the quantitative relationship between the activity of a brain region and its information processing capacity remains unclear. We introduce and validate a mathematical model of the information processing capacity of a brain region in terms of neuronal activity, input storage capacity, and the arrival rate of afferent information. We applied the model to fMRI data obtained from a flanker paradigm in young and old subjects. Our analysis showed that-for a given cognitive task and subject-higher information processing capacity leads to lower neuronal activity and faster responses. Crucially, processing capacity-as estimated from fMRI data-predicted task and age-related differences in reaction times, speaking to the model's predictive validity. This model offers a framework for modelling of brain dynamics in terms of information processing capacity, and may be exploited for studies of predictive coding and Bayes-optimal decision-making.
| S-EPMC8828878 | biostudies-literature
Project description:This paper considers analysis of human brain networks or graphs constructed from time-series collected from functional magnetic resonance imaging (fMRI). In the network of time-series, the nodes describe the regions and the edge weights correspond to the absolute values of correlation coefficients of the time-series of the two nodes associated with the edges. The paper introduces a novel information-theoretic metric, referred as sub-graph entropy, to measure uncertainty associated with a sub-graph. Nodes and edges constitute two special cases of sub-graph structures. Node and edge entropies are used in this paper to rank regions and edges in a functional brain network. The paper analyzes task-fMRI data collected from 475 subjects in the Human Connectome Project (HCP) study for gambling and emotion tasks. The proposed approach is used to rank regions and edges associated with these tasks. The differential node (edge) entropy metric is defined as the difference of the node (edge) entropy corresponding to two different networks belonging to two different classes. Differential entropy of nodes and edges are used to rank top regions and edges associated with the two classes of data. Using top node and edge entropy features separately, two-class classifiers are designed using support vector machine (SVM) with radial basis function (RBF) kernel and leave-one-out method to classify time-series for emotion task vs. no-task, gambling task vs. no-task and emotion task vs. gambling task. Using node entropies, the SVM classifier achieves classification accuracies of 0.96, 0.97 and 0.98, respectively. Using edge entropies, the classifier achieves classification accuracies of 0.91, 0.96 and 0.94, respectively.
| S-EPMC6527859 | biostudies-other
Project description:Directed information flow between brain regions might be disrupted in children with Attention Deficit Hyperactivity Disorder (ADHD) which is related to the behavioral characteristics of ADHD. This paper aims to investigate the different information pathways of brain networks in children with ADHD in comparison with healthy subjects. EEG recordings were obtained from 61 children with ADHD and 60 healthy children without neurological disorders during attentional visual task. Effective connectivity among all scalp channels was calculated using directed phase transfer entropy (dPTE) for delta, theta, alpha, beta, and lower-gamma frequency bands. Group differences were evaluated using permutation tests in connectivity between regions. Significant posterior to anterior patterns of information flow in theta frequency bands were found in healthy subjects (p-value < 0.05), while disrupted pattern flow, in an opposite way, was found in ADHD children. In the beta band, information flow in pathways between anterior regions was significantly higher in healthy individuals than in the ADHD group. These differences are more indicated in connectivity that leads from frontal and central regions to the right frontal regions of the brain (F8 electrode). Furthermore, connections from central and lateral parietal areas to Pz electrode areas are statistically significant and higher in healthy children in this band. In the delta band, internal connections in the anterior region show a significant difference between the two groups, as this amount is higher in the ADHD group. Our analysis may provide new insights into information flow in brain regions of ADHD children in comparison with healthy children.
| S-EPMC8572296 | biostudies-literature
Project description:People living with schizophrenia (SCZ) experience severe brain network deterioration. The brain is constantly fizzling with non-linear causal activities measured by electroencephalogram (EEG) and despite the variety of effective connectivity methods, only few approaches can quantify the direct non-linear causal interactions. To circumvent this problem, we are motivated to quantitatively measure the effective connectivity by multivariate transfer entropy (MTE) which has been demonstrated to be able to capture both linear and non-linear causal relationships effectively. In this work, we propose to construct the EEG effective network by MTE and further compare its performance with the Granger causal analysis (GCA) and Bivariate transfer entropy (BVTE). The simulation results quantitatively show that MTE outperformed GCA and BVTE under varied signal-to-noise conditions, edges recovered, sensitivity, and specificity. Moreover, its applications to the P300 task EEG of healthy controls (HC) and SCZ patients further clearly show the deteriorated network interactions of SCZ, compared to that of the HC. The MTE provides a novel tool to potentially deepen our knowledge of the brain network deterioration of the SCZ.
| S-EPMC6966771 | biostudies-literature
Project description:This article explores a graph clustering method that is derived from an information theoretic method that clusters points in Rn relying on Renyi entropy, which involves computing the usual Euclidean distance between these points. Two view points are adopted: (1) the graph to be clustered is first embedded into Rd for some dimension d so as to minimize the distortion of the embedding, then the resulting points are clustered, and (2) the graph is clustered directly, using as distance the shortest path distance for undirected graphs, and a variation of the Jaccard distance for directed graphs. In both cases, a hierarchical approach is adopted, where both the initial clustering and the agglomeration steps are computed using Renyi entropy derived evaluation functions. Numerical examples are provided to support the study, showing the consistency of both approaches (evaluated in terms of F-scores).
| S-EPMC7959621 | biostudies-literature
Project description:Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid.
| S-EPMC4271566 | biostudies-literature
Project description:Because of their exceptional capability to tailor the effective medium parameters, metamaterials have been widely used to control electromagnetic waves, which has led to the observation of many interesting phenomena, for example, negative refraction, invisibility cloaking, and anomalous reflections and transmissions. However, the studies of metamaterials or metasurfaces are mainly limited to their physical features; currently, there is a lack of viewpoints on metamaterials and metasurfaces from the information perspective. Here we propose to measure the information of a coding metasurface using Shannon entropy. We establish an analytical connection between the coding pattern of an arbitrary coding metasurface and its far-field pattern. We introduce geometrical entropy to describe the information of the coding pattern (or coding sequence) and physical entropy to describe the information of the far-field pattern of the metasurface. The coding metasurface is demonstrated to enhance the information in transmitting messages, and the amount of enhanced information can be manipulated by designing the coding pattern with different information entropies. The proposed concepts and entropy control method will be helpful in new information systems (for example, communication, radar and imaging) that are based on the coding metasurfaces.
| S-EPMC6059823 | biostudies-other
Project description:Graph models of cerebral vasculature derived from two-photon microscopy have shown to be relevant to study brain microphysiology. Automatic graphing of these microvessels remain problematic due to the vascular network complexity and two-photon sensitivity limitations with depth. In this paper, we propose a fully automatic processing pipeline to address this issue. The modeling scheme consists of a fully-convolution neural network to segment microvessels, a three-dimensional surface model generator, and a geometry contraction algorithm to produce graphical models with a single connected component. Based on a quantitative assessment using NetMets metrics, at a tolerance of 60 ?m, false negative and false positive geometric error 19 rates are 3.8% and 4.2%, respectively, whereas false nega- 20 tive and false positive topological error rates are 6.1% and 4.5%, respectively. Our qualitative evaluation confirms the efficiency of our scheme in generating useful and accurate graphical models.
| S-EPMC6546554 | biostudies-literature
Project description:BACKGROUND: Transfer entropy (TE) is a measure for the detection of directed interactions. Transfer entropy is an information theoretic implementation of Wiener's principle of observational causality. It offers an approach to the detection of neuronal interactions that is free of an explicit model of the interactions. Hence, it offers the power to analyze linear and nonlinear interactions alike. This allows for example the comprehensive analysis of directed interactions in neural networks at various levels of description. Here we present the open-source MATLAB toolbox TRENTOOL that allows the user to handle the considerable complexity of this measure and to validate the obtained results using non-parametrical statistical testing. We demonstrate the use of the toolbox and the performance of the algorithm on simulated data with nonlinear (quadratic) coupling and on local field potentials (LFP) recorded from the retina and the optic tectum of the turtle (Pseudemys scripta elegans) where a neuronal one-way connection is likely present. RESULTS: In simulated data TE detected information flow in the simulated direction reliably with false positives not exceeding the rates expected under the null hypothesis. In the LFP data we found directed interactions from the retina to the tectum, despite the complicated signal transformations between these stages. No false positive interactions in the reverse directions were detected. CONCLUSIONS: TRENTOOL is an implementation of transfer entropy and mutual information analysis that aims to support the user in the application of this information theoretic measure. TRENTOOL is implemented as a MATLAB toolbox and available under an open source license (GPL v3). For the use with neural data TRENTOOL seamlessly integrates with the popular FieldTrip toolbox.
| S-EPMC3287134 | biostudies-literature