Description Usage Arguments Value

A function that does one step through all the nodes in a mixed graph and tries to identify new edge coefficients using the existence of half-trek systems as described in Weihs, Robeva, Robinson, et al. (2017).

1 2 | ```
edgewiseIdentifyStep(mixedGraph, unsolvedParents, solvedParents,
identifier, subsetSizeControl = Inf)
``` |

`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 |

`subsetSizeControl` |
a positive integer (Inf allowed) which controls the size of edgesets searched in the edgewiseID algorithm. Suppose, for example, this has value 3. Then if a node i has n parents, this will restrict the algorithm to only look at subsets of the parents of size 1,2,3 and n-2, n-1, n. Making this parameter smaller means the algorithm will be faster but less exhaustive (and hence less powerful). |

see the return of `htcIdentifyStep`

.

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.