Faithfulness of Probability Distributions and Graphs

zbMATH Open1444.62079arXiv1701.08366MaRDI QIDQ4637081FDOQ4637081

Kayvan Sadeghi

Publication date: 17 April 2018

Abstract: A main question in graphical models and causal inference is whether, given a probability distribution $P$ (which is usually an underlying distribution of data), there is a graph (or graphs) to which $P$ 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.

Full work available at URL: https://arxiv.org/abs/1701.08366

zbMATH Keywords

directed acyclic graphstructural learningcausal discoverymixed graphindependence modelMarkov propertygraphical model selectionfaithfulnesscompositional graphoid

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Causation, prediction, and search
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Ancestral graph Markov models.
• Identifying independence in bayesian networks
• Probability distributions with summary graph structure
• Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
• A uniformly consistent estimator of causal effects under the \(k\)-triangle-faithfulness assumption
• Geometry of the faithfulness assumption in causal inference
• Markov Properties for Acyclic Directed Mixed Graphs
• Classes of orderings of measures and related correlation inequalities. I. Multivariate totally positive distributions
• 10.1162/153244303321897717
• Markov equivalence for ancestral graphs
• On chain graph models for description of conditional independence structures
• Markov fields and log-linear interaction models for contingency tables
• Sequences of regressions and their independences
• Stable mixed graphs
• Marginal AMP chain graphs
• Alternative Markov properties for chain graphs
• Marginalization and conditioning for LWF chain graphs
• Faithfulness in chain graphs: the discrete case
• Triangular systems for symmetric binary variables
• Total positivity in Markov structures
• Markov properties for mixed graphs
• Binary Models for Marginal Independence
• On association models defined over independence graphs
• M-matrices as covariance matrices of multinormal distributions
• GRAPHOIDS: Graph-Based Logic for Reasoning about Relevance Relations Or When Would x Tell You More about y If You Already Know z  ?

Cited In (9)

• Construction methods for gaussoids
• 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
• Title not available (Why is that?)
• The geometry of gaussoids
• Faithfulness in chain graphs: the discrete case
• Bayesian causal inference in probit graphical models
• On finite exchangeability and conditional independence

Uses Software

• TETRAD

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)