Description Usage Arguments Value References

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.

1 2 | ```
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
- Lambda
denote the number of nodes in `mixedGraph` as n. Then Lambda is an nxn matrix whose i,jth entryequals 0 if i is not a parent of j, equals NA if i is a parent of j but `identifier` cannot identify it generically,equals the (generically) unique value corresponding to the weight along the edge i->j that was used to produce Sigma.
- Omega
just as Lambda but for the bidirected edges in the mixed graph
such that if j is in |

a list

Drton, M. and Weihs, L. (2015) Generic Identifiability of Linear Structural Equation Models by Ancestor Decomposition. arXiv 1504.02992

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.