ancestralID

Uses the an identification criterion of Drton and Weihs (2015); this version
of the algorithm is somewhat different from Drton and Weihs (2015) in that it
also works on cyclic graphs. The original version of the algorithm can be
found in the function <code>graphID.ancestralID</code>.

Provides routines to check identifiability or non-identifiability
of linear structural equation models as described in Drton, Foygel, and
Sullivant (2011) <doi:10.1214/10-AOS859>, Foygel, Draisma, and Drton (2012)
<doi:10.1214/12-AOS1012>, and other works. The routines are based on the graphical
representation of structural equation models.

Nils Sturma

SEMID

Identifiability of Linear Structural Equation Models

Rina Foygel Barber

Mathias Drton

Luca Weihs

ancestralID function

<dl><dt>mixedGraph</dt>
<dd>a <code>MixedGraph</code> object representing the L-SEM.</dd>
<dt>tianDecompose</dt>
<dd>TRUE or FALSE determining whether or not the Tian
decomposition should be used before running the
current generic identification algorithm. In general
letting this be TRUE will make the algorithm faster and
more powerful.</dd></dl>

Arguments

Determines which edges in a mixed graph are ancestralID-identifiable — ancestralID

<dl>

<dt>mixedGraph</dt>
<dd>a <code>MixedGraph</code> object representing the L-SEM.</dd>


<dt>tianDecompose</dt>
<dd>TRUE or FALSE determining whether or not the Tian
decomposition should be used before running the
current generic identification algorithm. In general
letting this be TRUE will make the algorithm faster and
more powerful.</dd>

</dl>

ancestralID: Determines which edges in a mixed graph are ancestralID-identifiable

Description

Usage

Value

Arguments