ancestralIdentifyStep | R Documentation |
A function that does one step through all the nodes in a mixed graph and tries to determine if directed edge coefficients are generically identifiable by leveraging decomposition by ancestral subsets. See Algorithm 1 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.
ancestralIdentifyStep(mixedGraph, unsolvedParents, solvedParents, identifier)
mixedGraph |
a |
unsolvedParents |
a list whose ith index is a vector of all the parents j of i in G which for which the edge j->i is not yet known to be generically identifiable. |
solvedParents |
the complement of |
identifier |
an identification function that must produce the
identifications corresponding to those in solved parents. That is
such that if j is in |
a list with four components:
identifiedEdges
a matrix rx2 matrix where r is the number
of edges that where identified by this function call and
identifiedEdges[i,1] -> identifiedEdges[i,2]
was the ith edge
identified
unsolvedParents
as the input argument but updated with any newly identified edges
solvedParents
as the input argument but updated with any newly identified edges
identifier
as the input argument but updated with any newly identified edges
Drton, M. and Weihs, L. (2015) Generic Identifiability of Linear Structural Equation Models by Ancestor Decomposition. arXiv 1504.02992
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.