M-separation
id:
m-separation-194-1329704
title:
M-separation
text:
In statistics, m-separation is a measure of disconnectedness in ancestral graphs and a generalization of d-separation for directed acyclic graphs. It is the opposite of m-connectedness. Suppose G is an ancestral graph. For given source and target nodes s and t and a set Z of nodes in G\{s, t}, m-connectedness can be defined as follows. Consider a path from s to t. An intermediate node on the path is called a collider if both edges on the path touching it are directed toward the node. The path is
brand slug:
wiki
category slug:
encyclopedia
description:
Measure of disconnectedness in statistics
original url:
https://en.wikipedia.org/wiki/M-separation
date created:
date modified:
2022-03-02T16:01:17Z
main entity:
{"identifier":"Q6712110","url":"https://www.wikidata.org/entity/Q6712110"}
image:
fields total:
13
integrity:
14