trekSeparationIdentifyStep | R Documentation |
A function that does one step through all the nodes in a mixed graph and tries to identify new edge coefficients using trek-separation as described in Weihs, Robeva, Robinson, et al. (2017).
trekSeparationIdentifyStep(
mixedGraph,
unsolvedParents,
solvedParents,
identifier,
maxSubsetSize = 3
)
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 |
maxSubsetSize |
a positive integer which controls the maximum subset size considered in the trek-separation identification algorithm. Making this parameter smaller means the algorithm will be faster but less exhaustive (and hence less powerful). |
see the return of htcIdentifyStep
.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.