Measuring Information-Transfer Delays

Abstract

In complex networks such as gene networks, traffic systems or brain circuits it is important to understand how long it takes for the different parts of the network to effectively influence one another. In the brain, for example, axonal delays between brain areas can amount to several tens of milliseconds, adding an intrinsic component to any timing-based processing of information. Inferring neural interaction delays is thus needed to interpret the information transfer revealed by any analysis of directed interactions across brain structures. However, a robust estimation of interaction delays from neural activity faces several challenges if modeling assumptions on interaction mechanisms are wrong or cannot be made. Here, we propose a robust estimator for neuronal interaction delays rooted in an information-theoretic framework, which allows a model-free exploration of interactions. In particular, we extend transfer entropy to account for delayed source-target interactions, while crucially retaining the conditioning on the embedded target state at the immediately previous time step. We prove that this particular extension is indeed guaranteed to identify interaction delays between two coupled systems and is the only relevant option in keeping with Wiener’s principle of causality. We demonstrate the performance of our approach in detecting interaction delays on finite data by numerical simulations of stochastic and deterministic processes, as well as on local field potential recordings. We also show the ability of the extended transfer entropy to detect the presence of multiple delays, as well as feedback loops. While evaluated on neuroscience data, we expect the estimator to be useful in other fields dealing with network dynamics.

Graph analysis of functional brain networks: practical issues in translational neuroscience

“…trials or epochs) are commonly performed to increase the total number of the data points. The brain graph can then be obtained by integrating the information across trials with the same length [85]. The simplest way to do that is computing the FC after concatenating the trials or averaging the FC measures obtained from each single trial; more sophisticated approaches consist of exploiting the statistical variability of the trials to improve the final FC measure [66].…”

Utility, Revealed Preferences Theory, and Strategic Ambiguity in Iterated Games

“…This is one of many different specifications of TE, generalisations based on history length appears in Schreiber's original article [27], and further considerations of delays [28] as well as averaging the TE over whole systems of stochastic variables [29] have also been developed (for a recent review, see [30]). …”

Quantifying Information Modification in Developing Neural Networks via Partial Information Decomposition

“…Attempts at formally defining information modification have presented a considerable challenge, however, in contrast to the well established measures of information transfer [2][3][4][5][6] and active information storage [7][8][9]. This is because identifying the "modified" information in the output of a processing element amounts to distinguishing it from the information from any input that survives the passage through the processor in unmodified form.…”