Skip to content

Commit

Permalink
typos
Browse files Browse the repository at this point in the history
  • Loading branch information
xidongdxi committed Jun 10, 2024
1 parent ac6c374 commit 885c7fc
Show file tree
Hide file tree
Showing 6 changed files with 34 additions and 34 deletions.
4 changes: 2 additions & 2 deletions man/adjust_weights.Rd

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

20 changes: 10 additions & 10 deletions man/graph_generate_weights.Rd

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion man/graph_test_closure.Rd

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion man/plot.initial_graph.Rd

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 1 addition & 1 deletion vignettes/generate-closure.Rmd
Original file line number Diff line number Diff line change
Expand Up @@ -123,7 +123,7 @@ The conventional approach for power simulations is to repeat the following proce
+ Remove the rejected hypothesis and update the graph
+ Repeat until no more hypotheses can be rejected

Note that the same step to update the graph may repeat in many replications, whichmay be repetitive. For $m$ hypotheses, there are at most $2^m-1$ graphs depending on which hypotheses are rejected. These graphs correspond to the closure and the weighting strategy. Thus an idea to avoid redundant updating of graphs is to utilize the weighting strategy.
Note that the same step to update the graph may repeat in many replications, which may be repetitive. For $m$ hypotheses, there are at most $2^m-1$ graphs depending on which hypotheses are rejected. These graphs correspond to the closure and the weighting strategy. Thus an idea to avoid redundant updating of graphs is to utilize the weighting strategy.

## Power simulations using parent-child relationships

Expand Down
38 changes: 19 additions & 19 deletions vignettes/graph-examples.Rmd
Original file line number Diff line number Diff line change
Expand Up @@ -41,25 +41,25 @@ bonferroni_graph <- bonferroni(rep(1 / m, m))
# transitions <- matrix(0, m, m)
# bonferroni_graph <- graph_create(rep(1 / m, m), transitions)
# plot(
# bonferroni_graph,
# layout = igraph::layout_in_circle(
# as_igraph(bonferroni_graph),
# order = c(2, 1, 3)
# ),
# vertex.size = 70
# )
#
# p_values <- runif(m, 0, alpha)
#
# test_results <-
# graph_test_shortcut(
# bonferroni_graph,
# p = p_values,
# alpha = alpha
# )
#
# test_results$outputs$rejected
plot(
bonferroni_graph,
layout = igraph::layout_in_circle(
as_igraph(bonferroni_graph),
order = c(2, 1, 3)
),
vertex.size = 70
)
p_values <- runif(m, 0, alpha)
test_results <-
graph_test_shortcut(
bonferroni_graph,
p = p_values,
alpha = alpha
)
test_results$outputs$rejected
```

## Holm Procedure
Expand Down

0 comments on commit 885c7fc

Please sign in to comment.