Graph properties of DAG associahedra and related polytopes
A directed acyclic graph (DAG) can be thought of as encoding a set of conditional independence (CI) relations among random variables. Assuming we sample data from a probability distribution satisfying these CI relations, a fundamental problem in causal inference is to recover the edge-structure of t...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Matematik (Avd.)
2018
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-228406 |