htcID

Uses the half-trek criterion of Foygel, Draisma, and Drton (2012) determine
which edges in a mixed graph are generically identifiable. Depending on your
application it faster to use the <code>graphID.htcID</code> function
instead of this one, this function has the advantage of returning additional
information.

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

htcID 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 HTC-identifiable. — htcID

<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>

htcID: Determines which edges in a mixed graph are HTC-identifiable.

Description

Usage

Value

Arguments

References