mixedGraphHasSimpleNumbering

Checks that the input mixed graph has vertices are numbered from 1
to mixedGraph$numNodes(). Throws an error if they are not.

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

mixedGraphHasSimpleNumbering function

<dl><dt>mixedGraph</dt>
<dd>the mixed graph object</dd></dl>

Arguments

Checks that a MixedGraph has appropriate node numbering — mixedGraphHasSimpleNumbering

<dl>

<dt>mixedGraph</dt>
<dd>the mixed graph object</dd>

</dl>

mixedGraphHasSimpleNumbering: Checks that a MixedGraph has appropriate node numbering

Description

Usage

Arguments