SEMID0.4.1 package

Identifiability of Linear Structural Equation Models

ancestors

All ancestors of a collection of nodes

ancestralID

Determines which edges in a mixed graph are ancestralID-identifiable

ancestralIdentifyStep

Perform one iteration of ancestral identification.

bidirectedComponents

Get bidirected components of a mixed graph

children

All children of a collection of nodes.

createAncestralIdentifier

Create an ancestral identification function.

createEdgewiseIdentifier

Create an edgewise identification function

createHtcIdentifier

Create an htc identification function.

createIdentifierBaseCase

Create an identifier base case

createLFHtcIdentifier

Create a latent-factor half-trek critierion identification function.

createLFIdentifierBaseCase

Create an latent identifier base case

createSimpleBiDirIdentifier

Identify bidirected edges if all directed edges are identified

createTrekFlowGraph

Helper function to create a flow graph.

createTrekSeparationIdentifier

Create an trek separation identification function

createTrGraph

Helper function to create a graph encoding trek reachable relationship...

descendants

Get descendants of a collection of observed nodes

edgewiseID

Determines which edges in a mixed graph are edgewiseID-identifiable

edgewiseIdentifyStep

Perform one iteration of edgewise identification.

edgewiseTSID

Determines which edges in a mixed graph are edgewiseID+TS identifiable

flowBetween

Flow from one set of nodes to another.

FlowGraph

Construct FlowGraph object

generalGenericID

A general generic identification algorithm template.

getAncestors

Get getAncestors of nodes in a graph.

getDescendants

Get descendants of nodes in a graph.

getHalfTrekSystem

Determines if a half-trek system exists in the mixed graph.

getMaxFlow

Size of largest HT system Y satisfying the HTC for a node v except per...

getMixedCompForNode

Get the mixed component of a node in a mixed subgraph.

getMixedGraph

Get the corresponding mixed graph

getParents

Get getParents of nodes in a graph.

getSiblings

Get getSiblings of nodes in a graph.

getTrekSystem

Determines if a trek system exists in the mixed graph.

globalID

Determines whether a mixed graph is globally identifiable.

graphID.ancestralID

Determine generic identifiability of an acyclic mixed graph using ance...

graphID.decompose

Determine generic identifiability by Tian Decomposition and HTC

graphID.genericID

Determine generic identifiability of a mixed graph.

graphID.htcID

Determines if a mixed graph is HTC-identifiable.

graphID.main

Helper function to handle a graph component.

graphID.nonHtcID

Check for generic infinite-to-one via the half-trek criterion.

graphID

Identifiability of linear structural equation models.

htcID

Determines which edges in a mixed graph are HTC-identifiable.

htcIdentifyStep

Perform one iteration of HTC identification.

htr

Get all HTR nodes from a set of nodes in a graph.

htrFrom

Half trek reachable nodes.

inducedSubgraph

Get the induced subgraph on a collection of nodes

isSibling

Are two nodes siblings?

L

Get directed adjacency matrix.

LatentDigraph

Construct a LatentDigraph object

LatentDigraphFixedOrder

Construct LatentDigraphFixedOrder object

latentDigraphHasSimpleNumbering

Checks that a LatentDigraph has appropriate node numbering

latentNodes

Get all latent nodes in the graph.

lfhtcID

Determines which edges in a latent digraph are LF-HTC-identifiable.

lfhtcIdentifyStep

Perform one iteration of latent-factor HTC identification.

MixedGraph

Construct MixedGraph object

mixedGraphHasSimpleNumbering

Checks that a MixedGraph has appropriate node numbering

nodes

Get all nodes in the graph.

numLatents

Number of latent nodes in the graph.

numNodes

Number of nodes in the graph.

numObserved

Number of observed nodes in the graph.

O

Get adjacency matrix for bidirected part.

observedNodes

Get all observed nodes in the graph.

observedParents

Get the observed parents on a collection of nodes

parents

All parents of a collection of nodes.

plot

Plots the latent digraph

plotLatentDigraph

Plot a latent factor graph

plotMixedGraph

Plot a mixed graph

print.GenericIDResult

Prints a GenericIDResult object

print.LfhtcIDResult

Prints a LfhtcIDResult object

print.SEMIDResult

Prints a SEMIDResult object

SEMID-package

SEMID package documentation.

semID

Identifiability of linear structural equation models.

siblings

All siblings of a collection of nodes

stronglyConnectedComponent

Strongly connected component

subsetsOfSize

Returns all subsets of a certain size

tianComponent

Returns the Tian c-component of a node

tianDecompose

Performs the tian decomposition on the mixed graph

tianIdentifier

Identifies components in a tian decomposition

tianSigmaForComponent

Globally identify the covariance matrix of a C-component

toEx

Transforms a vector of node indices in the internal rep. into external...

toIn

Transforms a vector of given node indices into their internal numberin...

trekSeparationIdentifyStep

Perform one iteration of trek separation identification.

trFrom

Trek reachable nodes.

updateEdgeCapacities

Update edge capacities.

updateVertexCapacities

Update vertex capacities.

validateLatentNodesAreSources

A helper function to validate that latent nodes in a LatentDigraph are...

validateMatrices

A helper function to validate input matrices.

validateMatrix

A helper function to validate an input matrix.

validateNodes

A helper function to validate if input nodes are valid.

validateVarArgsEmpty

A helper function to validate that there are no variable arguments

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.

  • Maintainer: Nils Sturma
  • License: GPL (>= 2)
  • Last published: 2023-07-19