The problem of infinite information flow
Zheng Bian, Erik M. Bollt
TL;DR
The paper investigates conditional mutual information and its network generalizations in a dynamic setting where $X=T(Y,Z)$, revealing a zero-infinity dichotomy: TE is either $0$ or $+\infty$ under mild continuity, which hinders comparing information flow magnitudes. To address this, the authors introduce a discretization framework and a conjectured relative-ambiguity formula $A_T(Y)$, showing that discretized MI satisfies $I(X^{\Delta};Y^{\Delta})+\ln\Delta\to -A_T(Y)$ as $\Delta\to0^+$, thereby producing finite, comparable measures that reflect the system's ambiguity. They establish a disintegration-based expression for conditional mutual information, $I(X;Y|Z)=\int I(X_z;Y_z)\,dP_Z(z)$, reducing the analysis to conditioned MI on $Z$-slices. Numerical experiments on Bernoulli interval maps and sine box functions validate the discretization approach and illustrate how relative ambiguity tracks changes in information flow, providing a practical path to distinguishing flow magnitudes in deterministic dynamical systems.
Abstract
We study conditional mutual information (cMI) between a pair of variables $X,Y$ given a third one $Z$ and derived quantities including transfer entropy (TE) and causation entropy (CE) in the dynamically relevant context where $X=T(Y,Z)$ is determined by $Y,Z$ via a deterministic transformation $T$. Under mild continuity assumptions on their distributions, we prove a zero-infinity dichotomy for cMI for a wide class of $T$, which gives a yes-or-no answer to the question of information flow as quantified by TE or CE. Such an answer fails to distinguish between the relative amounts of information flow. To resolve this problem, we propose a discretization strategy and a conjectured formula to discern the \textit{relative ambiguities} of the system, which can serve as a reliable proxy for the relative amounts of information flow. We illustrate and validate this approach with numerical evidence.
