Ancestral Graph Markov Models

Abstract
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)
Categories No categories specified
(categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Translate to english
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,769
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Graphical Models, Causal Inference, and Econometric Models.Peter Spirtes - 2005 - Journal of Economic Methodology 12 (1):3-34.
Twilight Graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Isomorphisms and Nonisomorphisms of Graph Models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.

Monthly downloads

Added to index

2010-12-22

Total downloads

28 ( #181,018 of 2,158,886 )

Recent downloads (6 months)

1 ( #354,157 of 2,158,886 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums