get_neighboringDAGs

This functions takes any DAG with \(q\) nodes as input and returns all the neighboring DAGs, i.e. all those DAGs that
can be reached by the addition, removal or reversal of an edge.

A collection of functions for structure learning of causal networks and estimation of joint causal effects from observational Gaussian data. Main algorithm consists of a Markov chain Monte Carlo scheme for posterior inference of causal structures, parameters and causal effects between variables.
References:
F. Castelletti and A. Mascaro (2021) <doi:10.1007/s10260-021-00579-1>,
F. Castelletti and A. Mascaro (2022) <doi:10.48550/arXiv.2201.12003>.

Alessandro Mascaro

BCDAG

Bayesian Structure and Causal Learning of Gaussian Directed
Graphs

Federico Castelletti

get_neighboringDAGs function

<dl><dt>DAG</dt>
<dd>Adjacency matrix of a DAG</dd></dl>

Arguments

Enumerate all neighbors of a DAG — get_neighboringDAGs

<dl>

<dt>DAG</dt>
<dd>Adjacency matrix of a DAG</dd>

</dl>

get_neighboringDAGs: Enumerate all neighbors of a DAG

Description

Usage

Value

Arguments

Examples