New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Implement m-separation #204

Open

cthoyt opened this issue Jan 26, 2024 · 2 comments

Member

cthoyt commented Jan 26, 2024

https://en.wikipedia.org/wiki/M-separation

how is this different from d-separation and sigma separation?

Contributor

djinnome commented Jan 26, 2024

M-separation is just D-separation over a graph that contains bidirected edges.

Contributor

djinnome commented Jan 26, 2024

Ancestral graphs are a variant of ADMG's that don't allow both bidirected and directed edges between the same two nodes.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment