Faithfulness of probability distributions and graphs
From MaRDI portal
Publication:4637081
Abstract: A main question in graphical models and causal inference is whether, given a probability distribution (which is usually an underlying distribution of data), there is a graph (or graphs) to which is faithful. The main goal of this paper is to provide a theoretical answer to this problem. We work with general independence models, which contain probabilistic independence models as a special case. We exploit a generalization of ordering, called preordering, of the nodes of (mixed) graphs. This allows us to provide sufficient conditions for a given independence model to be Markov to a graph with the minimum possible number of edges, and more importantly, necessary and sufficient conditions for a given probability distribution to be faithful to a graph. We present our results for the general case of mixed graphs, but specialize the definitions and results to the better-known subclasses of undirected (concentration) and bidirected (covariance) graphs as well as directed acyclic graphs.
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 4094468 (Why is no real title available?)
- scientific article; zbMATH DE number 15992 (Why is no real title available?)
- scientific article; zbMATH DE number 42816 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 3635280 (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?)
- scientific article; zbMATH DE number 1862431 (Why is no real title available?)
- scientific article; zbMATH DE number 922429 (Why is no real title available?)
- 10.1162/153244303321897717
- A uniformly consistent estimator of causal effects under the k-triangle-faithfulness assumption
- Alternative Markov properties for chain graphs
- Ancestral graph Markov models.
- Binary Models for Marginal Independence
- Causality. Models, reasoning, and inference
- Causation, prediction, and search
- Classes of orderings of measures and related correlation inequalities. I. Multivariate totally positive distributions
- Faithfulness in chain graphs: the discrete case
- GRAPHOIDS: Graph-Based Logic for Reasoning about Relevance Relations Or When Would x Tell You More about y </
- Geometry of the faithfulness assumption in causal inference
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Identifying independence in bayesian networks
- Learning unfaithful K-separable Gaussian graphical models
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- M-matrices as covariance matrices of multinormal distributions
- Marginal AMP chain graphs
- Marginalization and conditioning for LWF chain graphs
- Markov Properties for Acyclic Directed Mixed Graphs
- Markov equivalence for ancestral graphs
- Markov fields and log-linear interaction models for contingency tables
- Markov properties for mixed graphs
- On Gaussian conditional independence structures
- On association models defined over independence graphs
- On chain graph models for description of conditional independence structures
- Probability distributions with summary graph structure
- Sequences of regressions and their independences
- Stable mixed graphs
- Total positivity in Markov structures
- Triangular systems for symmetric binary variables
Cited in
(21)- Learning causal graphs via nonlinear sufficient dimension reduction
- Geometry of the faithfulness assumption in causal inference
- DAGs as minimal \(\mathcal{I} \)-maps for the induced models of causal Bayesian networks under conditioning
- Faithfulness and learning hypergraphs from discrete distributions
- A local method for identifying causal relations under Markov equivalence
- Implications of faithfulness in graphical models
- Causal deep learning: encouraging impact on real-world problems through causality
- The geometry of gaussoids
- Joint structure learning and causal effect estimation for categorical graphical models
- Construction methods for gaussoids.
- Faithlessness in Gaussian graphical models
- When are graphical causal models not good models?
- Faithfulness in chain graphs: the discrete case
- Bayesian causal inference in probit graphical models
- Gaussian covariance faithful Markov trees
- Faithfulness, coordination and causal coincidences
- Learning unfaithful K-separable Gaussian graphical models
- A general framework on conditions for constraint-based causal learning
- A note on faithfulness and total positivity
- On finite exchangeability and conditional independence
- Axiomatization of interventional probability distributions
This page was built for publication: Faithfulness of probability distributions and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637081)
