5 problems
- 0 votes0 replies0 views
Uniqueness of the anticommutation relations for cubic graphs
Let a cubic graph be a graph whose edge operators satisfy the cubic-graph relations displayed in the source, and let the edge operators and their adjoints obey the anticommutation…
- 0 votes0 replies0 views
Graphical identification conjecture for optimal time-dependent adjustment sets
A time-dependent adjustment set is a collection of covariates used at multiple treatment time points to identify and estimate a longitudinal treatment effect; a sufficient time-dep…
- 0 votes0 replies0 views
The graph inclusion conjecture for DSCMs and SDCMs
Graph inclusion conjecture. The graph is a subgraph of .
- 0 votes0 replies0 views
Trivial incompatibility implies compatibility up to conditional independence
Let be a DAG and let be a support. Say that is trivially incompatible with when some -separation relation of induces a conditional indepe…
- 0 votes0 replies0 views
The HLP conjecture on algebraic mDAGs
Let be an mDAG. Write for the property that all causal compatibility constraints of are conditional independence relations, and let…