Latent-free equivalent mDAGs

09/14/2022
by   Robin J. Evans, et al.
0

We show that the marginal model for a discrete directed acyclic graph (DAG) with hidden variables is distributionally equivalent to another fully observable DAG model if and only if it does not induce any non-trivial inequality constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2021

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

Directed acyclic graphs (DAGs) with hidden variables are often used to c...
research
07/04/2012

A Transformational Characterization of Markov Equivalence for Directed Acyclic Graphs with Latent Variables

Different directed acyclic graphs (DAGs) may be Markov equivalent in the...
research
10/11/2020

Learning Linear Non-Gaussian Graphical Models with Multidirected Edges

In this paper we propose a new method to learn the underlying acyclic mi...
research
11/28/2019

Constraints in Gaussian Graphical Models

In this paper, we consider the problem of finding the constraints in bow...
research
01/12/2017

Functional Decomposition using Principal Subfields

Let f∈ K(t) be a univariate rational function. It is well known that any...
research
02/24/2022

Variable elimination, graph reduction and efficient g-formula

We study efficient estimation of an interventional mean associated with ...
research
06/15/2019

Does "www." Mean Better Transport Layer Security?

Experience shows that most researchers and developers tend to treat plai...

Please sign up or login with your details

Forgot password? Click here to reset