M-separation extends d-separation to mixed graphs: a path is open given a conditioning set when every noncollider is unconditioned and every collider has a conditioned descendant.

Ancestors (7)

  1. Acyclic directed mixed graph
  2. Causal directed acyclic graph
  3. Causal inference
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version