A factorization criterion for acyclic directed mixed graphs

06/26/2014
by   Thomas S. Richardson, et al.
0

Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present a factorization criterion for these models that is equivalent to the global Markov property given by (the natural extension of) d-separation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2012

Maximum likelihood fitting of acyclic directed mixed graphs to binary data

Acyclic directed mixed graphs, also known as semi-Markov models represen...
research
09/27/2011

Markov properties for mixed graphs

In this paper, we unify the Markov theory of a variety of different type...
research
07/20/2012

Parameter and Structure Learning in Nested Markov Models

The constraints arising from DAG models with latent variables can be nat...
research
10/07/2019

Identifying causal effects in maximally oriented partially directed acyclic graphs

We develop a necessary and sufficient causal identification criterion fo...
research
07/18/2022

The m-connecting imset and factorization for ADMG models

Directed acyclic graph (DAG) models have become widely studied and appli...
research
08/31/2010

Mixed Cumulative Distribution Networks

Directed acyclic graphs (DAGs) are a popular framework to express multiv...
research
10/07/2020

Acyclic Comprehension is equal to Stratified Comprehension

A new criterion of comprehension is defined, initially termed by myself ...

Please sign up or login with your details

Forgot password? Click here to reset