computePathMatrix

auxiliary file for SID: computes a path matrix efficiently (can probably be made faster)
This function takes an adjacency matrix G from a DAG and computes a path matrix for which entry(i,j) being one means that there is a directed path from i to j the diagonal will also be one.

The code computes the structural intervention distance (SID) between a true directed acyclic graph (DAG) and an estimated DAG. Definition and details about the implementation can be found in J. Peters and P. Bühlmann: "Structural intervention distance (SID) for evaluating causal graphs", Neural Computation 27, pages 771-799, 2015 <doi:10.1162/NECO_a_00708>.

Fred Gruber

Structural Intervention Distance

Jonas Peters

computePathMatrix function

<dl> <dt>G</dt>
<dd>graph.</dd> <dt>spars</dt>
<dd>boolean indicating whether G is a sparse matrix.</dd></dl>

Arguments

Jonas Peters &lt;jonas.peters@tuebingen.mpg.de&gt;

Author

auxiliary file for SID: computes a path matrix efficiently (can probably be made faster) — computePathMatrix

<dl>

 <dt>G</dt>
<dd>graph.</dd>

 <dt>spars</dt>
<dd>boolean indicating whether G is a sparse matrix.</dd>

</dl>

computePathMatrix: auxiliary file for SID: computes a path matrix efficiently (can probably be made faster)

Description

Usage

Value

Arguments

Author

See Also