Ancestral Graph Markov Models 963


This paper introduces a class of graphical independence models that is closed under marginalization and conditioning but that contains all DAG independence models. This class of graphs, called maximal ancestral graphs, has two attractive features: there is at most one edge between each pair of vertices; every missing edge corresponds to an independence relation. These features lead to a simple parameterization of the corresponding set of distributions in the Gaussian case.

Extracted Key Phrases

17 Figures and Tables

Citations per Year

279 Citations

Semantic Scholar estimates that this publication has 279 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Richardson2002AncestralGM, title={Ancestral Graph Markov Models 963}, author={Thomas O Richardson and Peter Spirtes}, year={2002} }