M-separation extends d-separation to mixed graphs: a path is open given a conditioning set when every noncollider is unconditioned and every collider is itself conditioned on or has a conditioned descendant.
New to topics? Read the docs here!
New to topics? Read the docs here!