This paper formalizes constraints as causal zeros within an Extended Causal Model by adding an activation operator, subject to local solvability and graph-admissibility conditions, and gives the extended do-calculus, identifiability conditions, counterfactual semantics, and open problems.
Abstract
Pearl's structural causal model (SCM) framework, built on directed acyclic graphs (DAGs) and the do-calculus, is the dominant formal language for causal reasoning. Yet it carries two structural restrictions: every relationship must be pre-specified as a directed causal edge, and feedback cycles are forbidden. This paper examines two classes of phenomena that strain these restrictions. First, symmetric physical and economic constraints, the ideal gas law being the canonical case, carry no intrinsic causal direction. Direction emerges only under intervention, and which variable is solved for must be specified as part of the intervention. We formalize such constraints as causal zeros within an Extended Causal Model by adding an activation operator, subject to local solvability and graph-admissibility conditions. Second, for the class of finite-propagation state-space systems considered here, we treat apparent instantaneous cycles as artifacts of suppressed time and ground both causal zeros and feedback in Causal Differential Equations (CDEs). In these, the transient regime is a time-unrolled acyclic causal process, and causal zeros arise as the defining functions of attracting equilibrium manifolds; periodic and chaotic attractors define further regimes of the same dynamics, treated through attractor-relative intervention. We give the extended do-calculus, identifiability conditions, counterfactual semantics, and open problems.
This work proposes bipartite graphical causal models (BGCMs), in which the structure of a system of equations is encoded by a bipartite graph with variable and equation nodes, and forms a Markov property in terms of a new graphical separation criterion (B-separation) that exploits the functional determinism inherent in...
We introduce causal graph rewriting, a model of computation in which local rules are applied on directed acyclic graphs in an asynchronous manner. The non-determinism arising from asynchrony is disciplined by the oriented edges, which must be understood as both computational dependencies and locality constraints---and...
P. Arrighi, Marin Costes, Luidnel Maignan· 0 citations
We develop a signal processing framework for signals indexed by the product of two directed acyclic graphs (DAGs) and described by a linear structural equation model (SEM). Such a setup arises whenever (linear) causal relations act along two domains, as in component versus manufacturing stage or gene versus experimenta...
Sundeep Prabhakar Chepuri, Antonio G. Marques, Maulik Devmurari et al.· 0 citations
Causal loops escape paradoxes if they generate valid probabilities under arbitrary independent local interventions. We show that a deterministic classical process is logically consistent if and only if it contains no signaling loops: cyclic signaling is forbidden but cyclic causation is not, allowing indefinite causal...
Hippolyte Dourdent, Andreas Leitherer, Emanuel-Cristian Boghiu et al.· 0 citations
We study causal discovery where each node is a random function. Previous studies on this topic rely on structural assumptions, e.g., linearity or non-linearity, and distributional assumptions, e.g., Gaussianity or non-Gaussianity. In contrast, we make use of covariance operators to avoid these assumptions. Under functi...
Complex systems are often organised into hierarchies whose internal interactions are stronger or faster than interactions across levels. When markets are treated as genuinely multilevel systems it becomes natural to represent them as systems with hierarchical causality. Here we show that reflexivity can be formulated w...
Tim Gebbie· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.