View source: R/tree-functions.R
zetas.tree | R Documentation |
Takes a forest structure as input, given by the couple C
, leaf_list
and returns the corresponding \zeta_k
's according to the method(s) chosen.
zetas.tree(
C,
leaf_list,
method,
pvalues,
alpha,
refine = FALSE,
verbose = FALSE,
...
)
C |
A list of list representing the forest structure. See |
leaf_list |
A list of vectors representing the atoms of the forest structure. See |
method |
A function with arguments |
pvalues |
A vector of |
alpha |
A target error level in |
refine |
A boolean, |
verbose |
A boolean, |
... |
Additional arguments that may be passed to specific |
The proportion of true nulls in each node is estimated by an union bound on the regions.
That is, the provided method(s) is/are applied at level \frac{\alpha}{K}
where K
is the number of regions.
In the step-down refinement, if we find a R_k
with associated \zeta_k=0
, that is, we think that the region
contains only false null hypotheses, we can remove it and run again the \zeta_k
's computation using K-1
instead of
K
in the union bound, and so on until we don't reduce the "effective" number of regions.
ZL
: A list of integer vectors representing the upper bounds \zeta_k
of the forest structure. See V.star()
for more information.
Durand, G., Blanchard, G., Neuvial, P., & Roquain, E. (2020). Post hoc false positive control for structured hypotheses. Scandinavian Journal of Statistics, 47(4), 1114-1148.
Durand, G. (2018). Multiple testing and post hoc bounds for heterogeneous data. PhD thesis, see Appendix B.2 for the step-down refinement.
Durand G. (2025). A fast algorithm to compute a curve of confidence upper bounds for the False Discovery Proportion using a reference family with a forest structure. arXiv:2502.03849.
m <- 1000
dd <- dyadic.from.window.size(m, s = 10, method = 2)
leaf_list <- dd$leaf_list
pvalues <- runif(m)
C <- dd$C
method <- zeta.trivial
ZL <- zetas.tree(C, leaf_list, method, pvalues, alpha = 0.05)
ZL
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.