Dependency in DAG models with Hidden Variables

06/14/2021

∙

Directed acyclic graph models with hidden variables have been much studied, particularly in view of their computational efficiency and connection with causal methods. In this paper we provide the circumstances under which it is possible for two variables to be identically equal, while all other observed variables stay jointly independent of them and mutually of each other. We find that this is possible if and only if the two variables are `densely connected'; in other words, if applications of identifiable causal interventions on the graph cannot (non-trivially) separate them. As a consequence of this, we can also allow such pairs of random variables have any bivariate joint distribution that we choose. This has implications for model search, since it suggests that we can reduce to only consider graphs in which densely connected vertices are always joined by an edge.

READ FULL TEXT

Dependency in DAG models with Hidden Variables

Entropic Inequality Constraints from e-separation Relations in Directed Acyclic Graphs with Hidden Variables

Identifying Conditional Causal Effects

Identifying Mixtures of Bayesian Network Distributions

SAM: Structural Agnostic Model, Causal Discovery and Penalized Adversarial Learning

Learning Functional Causal Models with Generative Neural Networks

Causal Discovery of a River Network from its Extremes

The most likely common cause

Dependency in DAG models with Hidden Variables

Related Research

Entropic Inequality Constraints from e-separation Relations in Directed Acyclic Graphs with Hidden Variables

Identifying Conditional Causal Effects

Identifying Mixtures of Bayesian Network Distributions

SAM: Structural Agnostic Model, Causal Discovery and Penalized Adversarial Learning

Learning Functional Causal Models with Generative Neural Networks

Causal Discovery of a River Network from its Extremes

The most likely common cause