Logic of minimal separation in causal networks (Q465930)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6361194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logic of minimal separation in causal networks |
scientific article; zbMATH DE number 6361194 |
Statements
Logic of minimal separation in causal networks (English)
0 references
24 October 2014
0 references
Markov property
0 references
cyclic digraph
0 references
acyclic digraph
0 references
m-separation
0 references
non-redundant separating set
0 references
collider
0 references
identification of edges
0 references
0.8359842896461487
0 references
0.7731852531433105
0 references
0.764899492263794
0 references
0.742184042930603
0 references
