LatentDigraphFixedOrder

Creates an object representing a directed graph with some number of
nodes which are latent (unobserved).

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

LatentDigraphFixedOrder function

<dl><dt>L</dt>
<dd>see <code>graphID</code> for the appropriate form of L. The
first numObserved rows of L correspond to the observed nodes in the
graph, all other nodes are considered unobserved.</dd>
<dt>numObserved</dt>
<dd>a non-negative integer representing the number of observed
nodes in the graph.</dd></dl>

Arguments

Construct LatentDigraphFixedOrder object — LatentDigraphFixedOrder

<dl>

<dt>L</dt>
<dd>see <code>graphID</code> for the appropriate form of L. The
first numObserved rows of L correspond to the observed nodes in the
graph, all other nodes are considered unobserved.</dd>


<dt>numObserved</dt>
<dd>a non-negative integer representing the number of observed
nodes in the graph.</dd>

</dl>

LatentDigraphFixedOrder: Construct LatentDigraphFixedOrder object

Description

Usage

Value

Arguments