MixedGraph

see <code><a rd-options="" href="/link/graphID?package=SEMID&version=0.3.2" data-mini-rdoc="SEMID::graphID">graphID</a></code> for the appropriate form of L.

the labeling of the vertices in the graph in the order
of the rows of L and O. Labels must be positive integers.

vertexNums

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 by a path diagram/mixed graph.

Luca Weihs

SEMID

Identifiability of Linear Structural Equation Models

Rina Foygel Barber

Mathias Drton

MixedGraph function

see <code><a rd-options='' href='graphID'>graphID</a></code> for the appropriate form of L.

MixedGraph: Construct MixedGraph object

Description

Usage

Arguments

Value