An Asymmetric Independence Model for Causal Discovery on Path Spaces

Georg Manten, Cecilia Casolo, Søren Wengel Mogensen, Niki Kilbertus
Proceedings of the Fourth Conference on Causal Learning and Reasoning, PMLR 275:64-89, 2025.

Abstract

In this paper, we develop the theory linking directed mixed graphs (DMGs) with the graphical ’E-separation’-criterion to form asymmetric independence models that are closed under marginalization and which graphically describe the conditional independence relations among coordinate processes in stochastic differential equations (SDEs) when testing "which variables enter the governing equations of which other variables." Besides a global Markov property for cyclic SDEs, which naturally extends to latent, cyclic SDEs, we also characterize graphs, which encode the same set of independence relations and show that in the fully observed case, modelled by directed graphs, each class of graphs under this equivalence relation has a maximal element that is graphi- cally characterizable, analogous to the famous ’same skeleton and V-structure’ result for Directed Acyclic Graphs (DAGs) and in addition is recoverable from data. Moreover, we conjecture that same holds true in the partially observed case and verify this empirically for graphs up to 4 nodes.

Cite this Paper

BibTeX
@InProceedings{pmlr-v275-manten25a, title = {An Asymmetric Independence Model for Causal Discovery on Path Spaces}, author = {Manten, Georg and Casolo, Cecilia and Mogensen, S\o{}ren Wengel and Kilbertus, Niki}, booktitle = {Proceedings of the Fourth Conference on Causal Learning and Reasoning}, pages = {64--89}, year = {2025}, editor = {Huang, Biwei and Drton, Mathias}, volume = {275}, series = {Proceedings of Machine Learning Research}, month = {07--09 May}, publisher = {PMLR}, pdf = {https://raw.githubusercontent.com/mlresearch/v275/main/assets/manten25a/manten25a.pdf}, url = {https://proceedings.mlr.press/v275/manten25a.html}, abstract = {In this paper, we develop the theory linking directed mixed graphs (DMGs) with the graphical ’E-separation’-criterion to form asymmetric independence models that are closed under marginalization and which graphically describe the conditional independence relations among coordinate processes in stochastic differential equations (SDEs) when testing "which variables enter the governing equations of which other variables." Besides a global Markov property for cyclic SDEs, which naturally extends to latent, cyclic SDEs, we also characterize graphs, which encode the same set of independence relations and show that in the fully observed case, modelled by directed graphs, each class of graphs under this equivalence relation has a maximal element that is graphi- cally characterizable, analogous to the famous ’same skeleton and V-structure’ result for Directed Acyclic Graphs (DAGs) and in addition is recoverable from data. Moreover, we conjecture that same holds true in the partially observed case and verify this empirically for graphs up to 4 nodes.} }
Endnote
%0 Conference Paper %T An Asymmetric Independence Model for Causal Discovery on Path Spaces %A Georg Manten %A Cecilia Casolo %A Søren Wengel Mogensen %A Niki Kilbertus %B Proceedings of the Fourth Conference on Causal Learning and Reasoning %C Proceedings of Machine Learning Research %D 2025 %E Biwei Huang %E Mathias Drton %F pmlr-v275-manten25a %I PMLR %P 64--89 %U https://proceedings.mlr.press/v275/manten25a.html %V 275 %X In this paper, we develop the theory linking directed mixed graphs (DMGs) with the graphical ’E-separation’-criterion to form asymmetric independence models that are closed under marginalization and which graphically describe the conditional independence relations among coordinate processes in stochastic differential equations (SDEs) when testing "which variables enter the governing equations of which other variables." Besides a global Markov property for cyclic SDEs, which naturally extends to latent, cyclic SDEs, we also characterize graphs, which encode the same set of independence relations and show that in the fully observed case, modelled by directed graphs, each class of graphs under this equivalence relation has a maximal element that is graphi- cally characterizable, analogous to the famous ’same skeleton and V-structure’ result for Directed Acyclic Graphs (DAGs) and in addition is recoverable from data. Moreover, we conjecture that same holds true in the partially observed case and verify this empirically for graphs up to 4 nodes.
APA
Manten, G., Casolo, C., Mogensen, S.W. & Kilbertus, N.. (2025). An Asymmetric Independence Model for Causal Discovery on Path Spaces. Proceedings of the Fourth Conference on Causal Learning and Reasoning, in Proceedings of Machine Learning Research 275:64-89 Available from https://proceedings.mlr.press/v275/manten25a.html.

Related Material