DeepAI AI Chat
Log In Sign Up

Distributional Equivalence and Structure Learning for Bow-free Acyclic Path Diagrams

by   Christopher Nowzohour, et al.
University of Oxford
ETH Zurich

We consider the problem of structure learning for bow-free acyclic path diagrams (BAPs). BAPs can be viewed as a generalization of linear Gaussian DAG models that allow for certain hidden variables. We present a first method for this problem using a greedy score-based search algorithm. We also prove some necessary and some sufficient conditions for distributional equivalence of BAPs which are used in an algorithmic ap- proach to compute (nearly) equivalent model structures. This allows us to infer lower bounds of causal effects. We also present applications to real and simulated datasets using our publicly available R-package.


page 1

page 2

page 3

page 4


Structure Learning for Cyclic Linear Causal Models

We consider the problem of structure learning for linear causal models b...

Causal Structure Learning with Greedy Unconditional Equivalence Search

We consider the problem of characterizing directed acyclic graph (DAG) m...

Characterizing Distribution Equivalence for Cyclic and Acyclic Directed Graphs

The main way for defining equivalence among acyclic directed graphs is b...

On the equivalence of linear cyclic and constacyclic codes

We introduce new sufficient conditions for permutation and monomial equi...

Conditional Path Analysis in Singly-Connected Path Diagrams

We extend the classical path analysis by showing that, for a singly-conn...

Causal Model Analysis using Collider v-structure with Negative Percentage Mapping

A major problem of causal inference is the arrangement of dependent node...

Scaling up Greedy Causal Search for Continuous Variables

As standardly implemented in R or the Tetrad program, causal search algo...

Code Repositories