Novel Brain Complexity Measures Based on Information Theory

• Published in: Entropy (Basel, Switzerland) Vol. 20; no. 7; p. 491
• Main Authors: Bonmati, Ester, Bardera, Anton, Feixas, Miquel, Boada, Imma
• Format: Journal Article
• Language: English
• Published: Switzerland MDPI 25.06.2018; MDPI AG
• Subjects: brain network; complex networks; connectome; graph theory; information theory; connectome; complex networks; information theory; graph theory; brain network
• ISSN: 1099-4300; 1099-4300
• DOI: 10.3390/e20070491

Brain networks are widely used models to understand the topology and organization of the brain. These networks can be represented by a graph, where nodes correspond to brain regions and edges to structural or functional connections. Several measures have been proposed to describe the topological features of these networks, but unfortunately, it is still unclear which measures give the best representation of the brain. In this paper, we propose a new set of measures based on information theory. Our approach interprets the brain network as a stochastic process where impulses are modeled as a random walk on the graph nodes. This new interpretation provides a solid theoretical framework from which several global and local measures are derived. Global measures provide quantitative values for the whole brain network characterization and include entropy, mutual information, and erasure mutual information. The latter is a new measure based on mutual information and erasure entropy. On the other hand, local measures are based on different decompositions of the global measures and provide different properties of the nodes. Local measures include entropic surprise, mutual surprise, mutual predictability, and erasure surprise. The proposed approach is evaluated using synthetic model networks and structural and functional human networks at different scales. Results demonstrate that the global measures can characterize new properties of the topology of a brain network and, in addition, for a given number of nodes, an optimal number of edges is found for small-world networks. Local measures show different properties of the nodes such as the uncertainty associated to the node, or the uniqueness of the path that the node belongs. Finally, the consistency of the results across healthy subjects demonstrates the robustness of the proposed measures.