Flow of dynamical causal structures with an application to correlations
Ämin Baumeler, Stefan Wolf
TL;DR
The paper addresses the challenge of dynamical causal order in classical-deterministic processes by introducing the flow of causal structures, a tool that visualizes how causal relations evolve under interventions. It provides two constructions: a flow (model-parameter aware) and a parameter-free superflow, with correctness and termination proofs and an exponential-time complexity analysis. A key result shows that if every leaf in a flow is trivial, the resulting correlations are causal, reinforcing prior findings about cycles with chords and offering a practical criterion to identify causal structures. The work also discusses the quantum generalization's obstacles, highlighting how dynamical causal order could be studied within relativistic contexts and outlining future directions for quantum causal models and computational bounds.
Abstract
Causal models capture cause-effect relations both qualitatively - via the graphical causal structure - and quantitatively - via the model parameters. They offer a powerful framework for analyzing and constructing processes. Here, we introduce a tool - the flow of causal structures - to visualize and explore the dynamical aspect of classical-deterministic processes, arguably like those present in general relativity. The flow describes all possible ways in which the causal structure of a process can evolve. We also present an algorithm to construct its supergraph - the superflow - from the causal structure only, without invoking the model parameters. As an application, we show that if all leaves of a flow are trivial, then the corresponding process produces causal correlations only, i.e., correlations where future data cannot influence past events. This strengthens the result that processes, where every directed cycle in their causal structure is chordless, establish causal correlations only. We also discuss the main difficulties for the quantum generalization of the present algorithms.
