Marginal AMP chain graphs
From MaRDI portal
Abstract: We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal AMP (MAMP) chain graphs because each of them is Markov equivalent to some AMP chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not only subsume AMP chain graphs but also multivariate regression chain graphs. We describe global and pairwise Markov properties for MAMP chain graphs and prove their equivalence for compositional graphoids. We also characterize when two MAMP chain graphs are Markov equivalent. For Gaussian probability distributions, we also show that every MAMP chain graph is Markov equivalent to some directed and acyclic graph with deterministic nodes under marginalization and conditioning on some of its nodes. This is important because it implies that the independence model represented by a MAMP chain graph can be accounted for by some data generating process that is partially observed and has selection bias. Finally, we modify MAMP chain graphs so that they are closed under marginalization for Gaussian probability distributions. This is a desirable feature because it guarantees parsimonious models under marginalization.
Recommendations
- Learning marginal AMP chain graphs under faithfulness revisited
- Learning marginal AMP chain graphs under faithfulness
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- Characterizing Markov equivalence classes for AMP chain graph models
- Alternative Markov properties for chain graphs
Cites work
- scientific article; zbMATH DE number 5957357 (Why is no real title available?)
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- Alternative Markov properties for chain graphs
- Ancestral graph Markov models.
- Chain graph interpretations and their relations
- Discrete chain graph models
- Identifying independence in bayesian networks
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Marginal log-linear parameters for graphical Markov models
- Marginalizing and conditioning in graphical models
- Markov properties for linear causal models with correlated errors
- Markov properties for mixed graphs
- Pattern recognition and machine learning.
- Separation and completeness properties for AMP chain graph Markov models.
- Stable mixed graphs
Cited in
(15)- AMP chain graphs: minimal separators and structure learning algorithms
- Unifying Markov properties for graphical models
- Faithfulness of probability distributions and graphs
- On a hypergraph probabilistic graphical model
- scientific article; zbMATH DE number 5957357 (Why is no real title available?)
- Marginalization and conditioning for LWF chain graphs
- Learning marginal AMP chain graphs under faithfulness revisited
- Causal effect identification in acyclic directed mixed graphs and gated models
- Factorization, inference and parameter learning in discrete AMP chain graphs
- Learning marginal AMP chain graphs under faithfulness
- On expressiveness of the AMP chain graph interpretation
- Every LWF and AMP chain graph originates from a set of causal models
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- Alternative Markov properties for chain graphs
- Phoretic self-propulsion of a slightly inhomogeneous disc
This page was built for publication: Marginal AMP chain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447777)
