ancestralID {SEMID}

Determines which edges in a mixed graph are ancestralID-identifiable

Description

Uses the an identification criterion of Drton and Weihs (2015); this version of the algorithm is somewhat different from Drton and Weihs (2015) in that it also works on cyclic graphs. The original version of the algorithm can be found in the function graphID.ancestralID.

Usage

ancestralID(mixedGraph, tianDecompose = T)

Arguments

mixedGraph

a MixedGraph object representing the L-SEM.

tianDecompose

TRUE or FALSE determining whether or not the Tian decomposition should be used before running the current generic identification algorithm. In general letting this be TRUE will make the algorithm faster and more powerful.

Value

see the return of generalGenericID.