Marginalization and conditioning for LWF chain graphs
From MaRDI portal
Abstract: In this paper, we deal with the problem of marginalization over and conditioning on two disjoint subsets of the node set of chain graphs (CGs) with the LWF Markov property. For this purpose, we define the class of chain mixed graphs (CMGs) with three types of edges and, for this class, provide a separation criterion under which the class of CMGs is stable under marginalization and conditioning and contains the class of LWF CGs as its subclass. We provide a method for generating such graphs after marginalization and conditioning for a given CMG or a given LWF CG. We then define and study the class of anterial graphs, which is also stable under marginalization and conditioning and contains LWF CGs, but has a simpler structure than CMGs.
Recommendations
Cites work
- scientific article; zbMATH DE number 4174001 (Why is no real title available?)
- scientific article; zbMATH DE number 3878159 (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?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- Alternative Markov properties for chain graphs
- Ancestral graph Markov models.
- Causality. Models, reasoning, and inference
- Chain graph models of multivariate regression type for categorical data
- Discrete chain graph models
- Faithfulness in chain graphs: the discrete case
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Marginal AMP chain graphs
- Marginalization and conditioning for LWF chain graphs
- Marginalizing and conditioning in graphical models
- Markov Properties for Acyclic Directed Mixed Graphs
- Markovian acyclic directed mixed graphs for discrete data
- On chain graph models for description of conditional independence structures
- Partial inversion for linear systems and partial closure of independence graphs
- Probability distributions with summary graph structure
- Sequences of regressions and their independences
- Stable mixed graphs
- Stratified exponential families: Graphical models and model selection
Cited in
(13)- A review of Gaussian Markov models for conditional independence
- Local structure recovery of chain graphs after marginalization
- Unifying Markov properties for graphical models
- On Block Ordering of Variables in Graphical Modelling
- Chain graph interpretations and their relations
- Two operations of merging and splitting components in a chain graph
- Explicit, identical maximum likelihood estimates for some cyclic Gaussian and cyclic Ising models
- Marginalizing and conditioning in graphical models
- Marginalization and conditioning for LWF chain graphs
- Every LWF and AMP chain graph originates from a set of causal models
- Chain graph interpretations and their relations revisited
- Faithfulness of probability distributions and graphs
- Marginal Markov subgraph of Bayesian network and its applications
This page was built for publication: Marginalization and conditioning for LWF chain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309746)
