Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Towards a Framework for Observational Causality from Time Series: When Shannon Meets Turing

Version 1 : Received: 9 January 2020 / Approved: 11 January 2020 / Online: 11 January 2020 (11:24:45 CET)

How to cite: Sigtermans, D. Towards a Framework for Observational Causality from Time Series: When Shannon Meets Turing. Preprints 2020, 2020010106. https://doi.org/10.20944/preprints202001.0106.v1 Sigtermans, D. Towards a Framework for Observational Causality from Time Series: When Shannon Meets Turing. Preprints 2020, 2020010106. https://doi.org/10.20944/preprints202001.0106.v1

Abstract

We propose a novel tensor-based formalism for inferring causal structures from time series. An information theoretical analysis of transfer entropy (TE), shows that TE results from transmission of information over a set of communication channels. Tensors are the mathematical equivalents of these multi-channel causal channels. A multi-channel causal channel is a generalization of a discrete memoryless channel (DMC). We consider a DMC as a single-channel causal channel. Investigation of a system comprising three variables shows that in our formalism, bivariate analysis suffices to differentiate between direct and indirect relations. For this to be true, we have to combine the output of multi-channel causal channels with the output of single-channel causal channels. We can understand this result when we consider the role of noise. Subsequent transmission of information over noisy channels can never result in less noisy transmission overall. This implies that a Data Processing Inequality (DPI) exists for transfer entropy.

Keywords

information theory; transfer entropy; time-delayed mutual information; data processing inequality; time series; causal tensor

Subject

Computer Science and Mathematics, Information Systems

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.