Description Usage Arguments Value Examples
For every root node in DAG defined by map
, paths
circles
over all possible path graphs, picks up the one that consists of the
most unmarked node, and then marks the nodes in the path graph that have been
selected. paths
won't move to the next root node, until all
the descendant nodes of the current root have been marked.
1 |
map |
Matrix of |
var |
Length- |
w |
Length- |
Returns assign
, a matrix of p
columns that gives the
assignments of variables over selected path graphs, and w.assign
, a
list of the same length as the number of rows in assign
.
assign |
Each row of |
w.assign |
The |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | # The following example appears in Figure 7 of Yan & Bien (2015).
# Generate map defining DAG.
map <- matrix(0, ncol=2, nrow=8)
map[1, ] <- c(1, 2)
map[2, ] <- c(2, 7)
map[3, ] <- c(3, 4)
map[4, ] <- c(4, 6)
map[5, ] <- c(6, 7)
map[6, ] <- c(6, 8)
map[7, ] <- c(3, 5)
map[8, ] <- c(5, 6)
# Assume two parameters per node.
var <- as.list(data.frame(t(matrix(1:16, ncol=2, byrow=TRUE))))
paths.result <- paths(map, var)
paths.result$assign
paths.result$w.assign
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.