Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2108.03018 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909156286398464 |
|---|---|
| author | Chancelier, Jean-Philippe de Lara, Michel Heymann, Benjamin |
| author_facet | Chancelier, Jean-Philippe de Lara, Michel Heymann, Benjamin |
| contents | The concept of d-separation holds a pivotal role in causality theory, serving as a fundamental tool for deriving conditional independence properties from causal graphs. Pearl defined the d-separation of two subsets conditionally on a third one. In this study, we present a novel perspective by showing i) how the d-separation can be extended beyond acyclic graphs, possibly infinite, and ii) how it can be expressed and characterized as a binary relation between vertices. Compared to the typical perspectives in causality theory, our equivalence opens the door to more compact and computational proofing techniques, because the language of binary relations is well adapted to equational reasoning. Additionally, and of independent interest, the proofs of the results presented in this paper are checked with the Coq proof assistant. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2108_03018 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Conditional Separation as a Binary Relation. A Coq Assisted Proof Chancelier, Jean-Philippe de Lara, Michel Heymann, Benjamin Discrete Mathematics The concept of d-separation holds a pivotal role in causality theory, serving as a fundamental tool for deriving conditional independence properties from causal graphs. Pearl defined the d-separation of two subsets conditionally on a third one. In this study, we present a novel perspective by showing i) how the d-separation can be extended beyond acyclic graphs, possibly infinite, and ii) how it can be expressed and characterized as a binary relation between vertices. Compared to the typical perspectives in causality theory, our equivalence opens the door to more compact and computational proofing techniques, because the language of binary relations is well adapted to equational reasoning. Additionally, and of independent interest, the proofs of the results presented in this paper are checked with the Coq proof assistant. |
| title | Conditional Separation as a Binary Relation. A Coq Assisted Proof |
| topic | Discrete Mathematics |
| url | https://arxiv.org/abs/2108.03018 |