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.
This paper deals with graphical models for chain graphs (CG) with a specific interpretation of conditional independence, generally known as the Lauritzen-Wermuth-Frydenberg (LWF) interpretation. The author focuses on the problem of marginalization over and conditioning on two disjoint subsets of the node set of CG -- with LWF Markov property. Finally he also discusses ``the implications of the results for probabilistic independence models that are faithful to LWF CGs, and possible ways to generalize the parametrizations existing in the literature for chain mixed graphs and anterial graphs.
Recommendations
- On chain graph models for description of conditional independence structures
- A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
- Marginalizing and conditioning in graphical models
- scientific article; zbMATH DE number 4174001
- Marginal AMP chain graphs
Cites work
- 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
- 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?)
- 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
(16)- Local structure recovery of chain graphs after marginalization
- Unifying Markov properties for graphical models
- On chain graph models for description of conditional independence structures
- Marginalizing and conditioning in graphical models
- A review of Gaussian Markov models for conditional independence
- Chain graph interpretations and their relations revisited
- Marginalization and conditioning for LWF chain graphs
- On Block Ordering of Variables in Graphical Modelling
- Every LWF and AMP chain graph originates from a set of causal models
- Two operations of merging and splitting components in a chain graph
- Faithfulness of probability distributions and graphs
- Chain graph interpretations and their relations
- Explicit, identical maximum likelihood estimates for some cyclic Gaussian and cyclic Ising models
- Marginal Markov subgraph of Bayesian network and its applications
- DAGs as minimal \(\mathcal{I} \)-maps for the induced models of causal Bayesian networks under conditioning
- Chain graph structure learning based on minimal c-separation trees
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)
