Markov-Equivalent Conditional Independence Graphs on Path Spaces

Causal discovery for continuous-time stochastic processes with latent confounding typically faces a trade-off between (i) approaches that are highly informative about the causal structure but are difficult to test statistically, and (ii) approaches that admit practical tests from data but yield more coarse-grained conclusions, potentially not leveraging the direction of time. We introduce W-separation, an asymmetric graphical criterion for directed mixed graphs defined as a quaternary relation that allows distinct conditioning on past and future components. This added flexibility yields a highly informative graphical independence model while preserving testability. W-separation satisfies a global Markov property for a broad class of stochastic differential equations with latent confounding, linking it to conditional independence relations among coordinate processes that are testable from data. A central result of this work is the full characterization of W-Markov equivalence classes: we show that every equivalence class admits a unique greatest element that serves as a canonical representative and a principled target for learning algorithms. In addition, we provide necessary and sufficient conditions under which directed or bidirected edges can be added without altering the induced independence model.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20877
Primary Topic
Bayesian Modeling and Causal Inference
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Markov-Equivalent Conditional Independence Graphs on Path Spaces

Niki Kilbertus, Georg Manten, Simon Kempf
arXiv (Cornell University)
Bayesian Modeling and Causal Inference
preprint

Markov-Equivalent Conditional Independence Graphs on Path Spaces

Niki Kilbertus, Georg Manten, Simon Kempf
preprint en

Abstract

Causal discovery for continuous-time stochastic processes with latent confounding typically faces a trade-off between (i) approaches that are highly informative about the causal structure but are difficult to test statistically, and (ii) approaches that admit practical tests from data but yield more coarse-grained conclusions, potentially not leveraging the direction of time. We introduce W-separation, an asymmetric graphical criterion for directed mixed graphs defined as a quaternary relation that allows distinct conditioning on past and future components. This added flexibility yields a highly informative graphical independence model while preserving testability. W-separation satisfies a global Markov property for a broad class of stochastic differential equations with latent confounding, linking it to conditional independence relations among coordinate processes that are testable from data. A central result of this work is the full characterization of W-Markov equivalence classes: we show that every equivalence class admits a unique greatest element that serves as a canonical representative and a principled target for learning algorithms. In addition, we provide necessary and sufficient conditions under which directed or bidirected edges can be added without altering the induced independence model.

arXiv (Cornell University)
Bayesian Modeling and Causal Inference
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon