scholarly journals Conditional Mutual Information Maps as Descriptors of Net Connectivity Levels in the Brain

Author(s):  
Raymond Salvador ◽  
Maria Anguera ◽  
Jesús J. Gomar ◽  
Edward T. Bullmore ◽  
Edith Pomarol-Clotet
2021 ◽  
Vol 2021 (9) ◽  
Author(s):  
Alex May

Abstract We prove a theorem showing that the existence of “private” curves in the bulk of AdS implies two regions of the dual CFT share strong correlations. A private curve is a causal curve which avoids the entanglement wedge of a specified boundary region $$ \mathcal{U} $$ U . The implied correlation is measured by the conditional mutual information $$ I\left({\mathcal{V}}_1:\left.{\mathcal{V}}_2\right|\mathcal{U}\right) $$ I V 1 : V 2 U , which is O(1/GN) when a private causal curve exists. The regions $$ {\mathcal{V}}_1 $$ V 1 and $$ {\mathcal{V}}_2 $$ V 2 are specified by the endpoints of the causal curve and the placement of the region $$ \mathcal{U} $$ U . This gives a causal perspective on the conditional mutual information in AdS/CFT, analogous to the causal perspective on the mutual information given by earlier work on the connected wedge theorem. We give an information theoretic argument for our theorem, along with a bulk geometric proof. In the geometric perspective, the theorem follows from the maximin formula and entanglement wedge nesting. In the information theoretic approach, the theorem follows from resource requirements for sending private messages over a public quantum channel.


2015 ◽  
Vol 6 (2) ◽  
pp. 23-46
Author(s):  
Tom Chothia ◽  
Chris Novakovic ◽  
Rajiv Ranjan Singh

This paper presents a framework for calculating measures of data integrity for programs in a small imperative language. The authors develop a Markov chain semantics for their language which calculates Clarkson and Schneider's definitions of data contamination, data suppression, program suppression and program transmission. The authors then propose their own definition of program integrity for probabilistic specifications. These definitions are based on conditional mutual information and entropy; they present a result relating them to mutual information, which can be calculated by a number of existing tools. The authors extend a quantitative information flow tool (CH-IMP) to calculate these measures of integrity and demonstrate this tool with examples including error correcting codes, the Dining Cryptographers protocol and the attempts by a number of banks to influence the Libor rate.


2020 ◽  
Vol 39 (6) ◽  
pp. 1957-1966
Author(s):  
Padmavathi Sundaram ◽  
Martin Luessi ◽  
Marta Bianciardi ◽  
Steven Stufflebeam ◽  
Matti Hamalainen ◽  
...  

Entropy ◽  
2019 ◽  
Vol 21 (3) ◽  
pp. 300 ◽  
Author(s):  
Shuaizong Si ◽  
Bin Wang ◽  
Xiao Liu ◽  
Chong Yu ◽  
Chao Ding ◽  
...  

Alzheimer’s disease (AD) is a progressive disease that causes problems of cognitive and memory functions decline. Patients with AD usually lose their ability to manage their daily life. Exploring the progression of the brain from normal controls (NC) to AD is an essential part of human research. Although connection changes have been found in the progression, the connection mechanism that drives these changes remains incompletely understood. The purpose of this study is to explore the connection changes in brain networks in the process from NC to AD, and uncovers the underlying connection mechanism that shapes the topologies of AD brain networks. In particular, we propose a mutual information brain network model (MINM) from the perspective of graph theory to achieve our aim. MINM concerns the question of estimating the connection probability between two cortical regions with the consideration of both the mutual information of their observed network topologies and their Euclidean distance in anatomical space. In addition, MINM considers establishing and deleting connections, simultaneously, during the networks modeling from the stage of NC to AD. Experiments show that MINM is sufficient to capture an impressive range of topological properties of real brain networks such as characteristic path length, network efficiency, and transitivity, and it also provides an excellent fit to the real brain networks in degree distribution compared to experiential models. Thus, we anticipate that MINM may explain the connection mechanism for the formation of the brain network organization in AD patients.


Sign in / Sign up

Export Citation Format

Share Document