latentDigraphHasSimpleNumbering

Checks that the input latent digraph has nodes numbered from 1
to latentDigraph$numObserved()+latentDigraph$numLatents(). The first latentDigraph$numObserved()
nodes correspond to the observed nodes in the graph, all other nodes are considered unobserved.
Throws an error if this is not true.

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

latentDigraphHasSimpleNumbering function

<dl><dt>graph</dt>
<dd>a <code>LatentDigraph</code> object representing
the latent-factor graph. All latent nodes in this graph should be
source nodes (i.e. have no parents).</dd></dl>

Arguments

Checks that a LatentDigraph has appropriate node numbering — latentDigraphHasSimpleNumbering

<dl>

<dt>graph</dt>
<dd>a <code>LatentDigraph</code> object representing
the latent-factor graph. All latent nodes in this graph should be
source nodes (i.e. have no parents).</dd>

</dl>

latentDigraphHasSimpleNumbering: Checks that a LatentDigraph has appropriate node numbering

Description

Usage

Arguments