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.
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
A Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs.Jiji Zhang & Peter Spirtes - unknown
Graphical Models, Causal Inference, and Econometric Models.Peter Spirtes - 2005 - Journal of Economic Methodology 12 (1):3-34.
A Characterization of Markov Equivalence Classes for Ancestral Graphical Models.Jiji Zhang & Peter Spirtes - unknown
Isomorphisms and Nonisomorphisms of Graph Models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
Isomorphism and Equational Equivalence of Continuous Λ-Models.Rainer Kerth - 1998 - Studia Logica 61 (3):403-415.
Using D-Separation to Calculate Zero Partial Correlations in Linear Models with Correlated Errors.Peter Spirtes, Thomas Richardson, Christopher Meek, Richard Scheines & Clark Glymour - unknown
Should Causal Models Always Be Markovian? The Case of Multi-Causal Forks in Medicine.Donald Gillies & Aidan Sudbury - 2013 - European Journal for Philosophy of Science 3 (3):275-308.
Added to index2010-12-22
Total downloads28 ( #181,018 of 2,158,886 )
Recent downloads (6 months)1 ( #354,157 of 2,158,886 )
How can I increase my downloads?