Ancestral graph¶
A mixed graph using directed, bidirected and undirected edges to encode conditional independences left by latent-variable marginalization and selection conditioning in a DAG.
Core Idea¶
Arrowheads cannot point to ancestors, undirected-edge endpoints cannot carry arrowheads and maximal ancestral graphs add a separate condition ensuring every missing edge represents an independence. Hidden common causes become bidirected edges, selection effects can become undirected edges and graph separation rules preserve observable conditional-independence structure without explicitly retaining latent nodes. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Ancestral graph belongs to graphical models and is useful where the analyst can specify the typed graphical models carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the observed vertex set, directed bidirected and undirected edge semantics, ancestor relation and acyclicity, arrowhead and undirected-endpoint restrictions, latent and selection variables represented, m-separation criterion, maximality, inducing paths and relation to DAG MAG and PAG models are explicit. The scope is broad within that domain but bounded by the need for the observed vertex set, directed bidirected and undirected edge semantics, ancestor relation and acyclicity, arrowhead and undirected-endpoint restrictions, latent and selection variables represented, m-separation criterion, maximality, inducing paths and relation to DAG MAG and PAG models are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the observed vertex set, directed bidirected and undirected edge semantics, ancestor relation and acyclicity, arrowhead and undirected-endpoint restrictions, latent and selection variables represented, m-separation criterion, maximality, inducing paths and relation to DAG MAG and PAG models are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Ancestral graph. Ancestral graph compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed graphical models carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the observed vertex set, directed bidirected and undirected edge semantics, ancestor relation and acyclicity, arrowhead and undirected-endpoint restrictions, latent and selection variables represented, m-separation criterion, maximality, inducing paths and relation to DAG MAG and PAG models are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of graphical models because they reuse the typed graphical models carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Hidden common causes become bidirected edges, selection effects can become undirected edges and graph separation rules preserve observable conditional-independence structure without explicitly retaining latent nodes., and type the carrier, state every parameter and convention in the definition, test that the observed vertex set, directed bidirected and undirected edge semantics, ancestor relation and acyclicity, arrowhead and undirected-endpoint restrictions, latent and selection variables represented, m-separation criterion, maximality, inducing paths and relation to DAG MAG and PAG models are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Ancestral graph Domain-specific
Parents (1) — more general patterns this builds on
-
Ancestral graph is a kind of Representation Prime
The proposed strict upward parent is
prime:representation.
Hierarchy path (1) — routes to 1 parentless root
- Ancestral graph → Representation → Abstraction
Neighborhood in Abstraction Space¶
Ancestral graph sits in a crowded region of the domain-specific corpus (24th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Graph Invariants & Constructions (49 abstractions)
Nearest neighbors
- Factor graph — 0.93
- Orientation (graph theory) — 0.91
- Join (graph theory) — 0.91
- Split graph — 0.91
- Matching (graph theory) — 0.91
Computed from structural-signature embeddings · 2026-09-08