Ancestral graph

From Wikipedia, the free encyclopedia

You have new messages (last change).

An ancestral graph is a graph with three types of edges: directed edge, bidirected edge, and undirected edge such that it can be decomposed into three parts: an undirected subgraph, a directed subgraph, and directed edges pointing from the undirected subgraph to the directed subgraph.

An ancestral graph G over nodes V is maximal if for every pair (x, y) of non-adjacent nodes in G, there exists a set Z of nodes in V \{x, y} such that x and y are m-separated by Z in G.

 This mathematics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../a/n/c/Ancestral_graph.html"