Description Usage Arguments Value References

A function that does one step through all the nodes in a latent factor graph and tries to identify new edge coefficients using the existence of half-trek systems as described in TO BE WRITTEN.

1 2 | ```
lfhtcIdentifyStep(graph, unsolvedParents, solvedParents, identifier,
subsetSizeControl = Inf)
``` |

`graph` |
a |

`unsolvedParents` |
a list whose ith index is a vector of all the parents j of i in the graph 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 `graph` 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 error covariance matrix for the latent factor graph.
such that if j is in |

`subsetSizeControl` |
the largest subset of latent nodes to consider. |

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

TO BE WRITTEN

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.