MMCTest-A Safe Algorithm for Implementing Multiple Monte Carlo Tests

Consider testing multiple hypotheses using tests that can only be evaluated by simulation, such as permutation tests or bootstrap tests. This article introduces MMCTest, a sequential algorithm that gives, with arbitrarily high probability, the same classification as a specific multiple testing proce...

Full description

Saved in:
Bibliographic Details
Published inScandinavian journal of statistics Vol. 41; no. 4; pp. 1083 - 1101
Main Authors Gandy, Axel, Hahn, Georg
Format Journal Article
LanguageEnglish
Published Oxford Blackwell Publishing Ltd 01.12.2014
Wiley Publishing
Subjects
Online AccessGet full text
ISSN0303-6898
1467-9469
DOI10.1111/sjos.12085

Cover

More Information
Summary:Consider testing multiple hypotheses using tests that can only be evaluated by simulation, such as permutation tests or bootstrap tests. This article introduces MMCTest, a sequential algorithm that gives, with arbitrarily high probability, the same classification as a specific multiple testing procedure applied to ideal p-values. The method can be used with a class of multiple testing procedures that include the Benjamini and Hochberg false discovery rate procedure and the Bonferroni correction controlling the familywise error rate. One of the key features of the algorithm is that it stops sampling for all the hypotheses that can already be decided as being rejected or non-rejected. MMCTest can be interrupted at any stage and then returns three sets of hypotheses: the rejected, the non-rejected and the undecided hypotheses. A simulation study motivated by actual biological data shows that MMCTest is usable in practice and that, despite the additional guarantee, it can be computationally more efficient than other methods.
Bibliography:istex:E540F00AFAADFE426BA6D6A1C664E318454B93E3
ArticleID:SJOS12085
ark:/67375/WNG-2526TPML-N
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0303-6898
1467-9469
DOI:10.1111/sjos.12085