MixedGraph

Creates an object representing a mixed graph. The methods that are currently
available to be used on the mixed graph include<ol>
<li>ancestors</li>
<li>descendants</li>
<li>parents</li>
<li>siblings</li>
<li>isSibling</li>
<li>htrFrom</li>
<li>trFrom</li>
<li>getHalfTrekSystem</li>
<li>getTrekSystem</li>
<li>inducedSubgraph</li>
<li>L</li>
<li>O</li>
<li>nodes</li>
<li>numNodes</li>
<li>stronglyConnectedComponent</li>
<li>tianComponent</li>
<li>tianDecompose</li>
</ol>see the individual function documentation for more 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

MixedGraph function

<dl><dt>L</dt>
<dd>see <code>graphID</code> for the appropriate form of L.</dd>
<dt>O</dt>
<dd>as for L.</dd>
<dt>vertexNums</dt>
<dd>the labeling of the vertices in the graph in the order
of the rows of L and O. Labels must be positive integers.</dd></dl>

Arguments

Construct MixedGraph object — MixedGraph

<dl>

<dt>L</dt>
<dd>see <code>graphID</code> for the appropriate form of L.</dd>


<dt>O</dt>
<dd>as for L.</dd>


<dt>vertexNums</dt>
<dd>the labeling of the vertices in the graph in the order
of the rows of L and O. Labels must be positive integers.</dd>

</dl>

MixedGraph: Construct MixedGraph object

Description

Usage

Value

Arguments