Probability distributions with summary graph structure
From MaRDI portal
Redirect page
Abstract: A set of independence statements may define the independence structure of interest in a family of joint probability distributions. This structure is often captured by a graph that consists of nodes representing the random variables and of edges that couple node pairs. One important class contains regression graphs. Regression graphs are a type of so-called chain graph and describe stepwise processes, in which at each step single or joint responses are generated given the relevant explanatory variables in their past. For joint densities that result after possible marginalising or conditioning, we introduce summary graphs. These graphs reflect the independence structure implied by the generating process for the reduced set of variables and they preserve the implied independences after additional marginalising and conditioning. They can identify generating dependences that remain unchanged and alert to possibly severe distortions due to direct and indirect confounding. Operators for matrix representations of graphs are used to derive these properties of summary graphs and to translate them into special types of paths in graphs.
Recommendations
Cites work
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 3115438 (Why is no real title available?)
- scientific article; zbMATH DE number 5711167 (Why is no real title available?)
- scientific article; zbMATH DE number 44577 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 3602484 (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 4867 (Why is no real title available?)
- scientific article; zbMATH DE number 802837 (Why is no real title available?)
- scientific article; zbMATH DE number 922429 (Why is no real title available?)
- A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
- A graphical characterization of lattice conditional independence models
- Ancestral graph Markov models.
- Causation, prediction, and search
- Chain graph models of multivariate regression type for categorical data
- Complete and symmetrically complete families of distributions
- Computing maximum likelihood estimates in recursive linear models with correlated errors
- Conditional association and unidimensionality in monotone latent variable models
- Decomposition of maximum likelihood in mixed graphical interaction models
- Discrete chain graph models
- Distortion of effects caused by indirect confounding
- Gaussian Markov distributions over finite graphs
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Identifying independence in bayesian networks
- Ignorable common information, null sets and Basu's first theorem
- Joint Response Graphs and Separation Induced by Triangular Systems
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Marginalizing and conditioning in graphical models
- Markov properties for linear causal models with correlated errors
- Matrix representations and independencies in directed acyclic graphs
- Miscellanea. On the generation of the chordless four-cycle
- On association models defined over independence graphs
- On joint completeness: sampling and Bayesian versions, and their connections
- On rigid circuit graphs
- Partial inversion for linear systems and partial closure of independence graphs
- Principles of Statistical Inference
- Sequences of regressions and their independences
- The Estimation of Economic Relationships using Instrumental Variables
- Triangular systems for symmetric binary variables
Cited in
(28)- Nested Markov properties for acyclic directed mixed graphs
- Computation of maximum likelihood estimates in cyclic structural equation models
- Smooth, identifiable supermodels of discrete DAG models with latent variables
- DAGs as minimal \(\mathcal{I} \)-maps for the induced models of causal Bayesian networks under conditioning
- Unifying Markov properties for graphical models
- On the causal interpretation of acyclic mixed graphs under multivariate normality
- Faithfulness of probability distributions and graphs
- Graphs for margins of Bayesian networks
- Joint Response Graphs and Separation Induced by Triangular Systems
- Marginalization and conditioning for LWF chain graphs
- Markovian acyclic directed mixed graphs for discrete data
- scientific article; zbMATH DE number 2104100 (Why is no real title available?)
- Traceable regressions
- Gaussian-related undirected graphical models for circular variables
- Comments on: Sequences of regressions and their independencies
- Comments on: Sequences of regressions and their independences
- Probabilistic construction of proportional graphs
- Sequences of regressions and their independences
- Causal structure learning: a combinatorial perspective
- Global identifiability of linear structural equation models
- Half-trek criterion for generic identifiability of linear structural equation models
- A review of Gaussian Markov models for conditional independence
- Stable mixed graphs
- Binary distributions of concentric rings
- Explicit, identical maximum likelihood estimates for some cyclic Gaussian and cyclic Ising models
- Empirical likelihood for linear structural equation models with dependent errors
- Markov properties for mixed graphs
- Nested covariance determinants and restricted trek separation in Gaussian graphical models
This page was built for publication: Probability distributions with summary graph structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638759)
