Open Access
2018 New FDR bounds for discrete and heterogeneous tests
Sebastian Döhler, Guillermo Durand, Etienne Roquain
Electron. J. Statist. 12(1): 1867-1900 (2018). DOI: 10.1214/18-EJS1441

Abstract

To find interesting items in genome-wide association studies or next generation sequencing data, a crucial point is to design powerful false discovery rate (FDR) controlling procedures that suitably combine discrete tests (typically binomial or Fisher tests). In particular, recent research has been striving for appropriate modifications of the classical Benjamini-Hochberg (BH) step-up procedure that accommodate discreteness and heterogeneity of the data. However, despite an important number of attempts, these procedures did not come with theoretical guarantees. In this paper, we provide new FDR bounds that allow us to fill this gap. More specifically, these bounds make it possible to construct BH-type procedures that incorporate the discrete and heterogeneous structure of the data and provably control the FDR for any fixed number of null hypotheses (under independence). Markedly, our FDR controlling methodology also allows to incorporate the quantity of signal in the data (corresponding therefore to a so-called $\pi_{0}$-adaptive procedure) and to recover some prominent results of the literature. The power advantage of the new methods is demonstrated in a numerical experiment and for some appropriate real data sets.

Citation

Download Citation

Sebastian Döhler. Guillermo Durand. Etienne Roquain. "New FDR bounds for discrete and heterogeneous tests." Electron. J. Statist. 12 (1) 1867 - 1900, 2018. https://doi.org/10.1214/18-EJS1441

Information

Received: 1 November 2017; Published: 2018
First available in Project Euclid: 13 June 2018

zbMATH: 06890101
MathSciNet: MR3813600
Digital Object Identifier: 10.1214/18-EJS1441

Subjects:
Primary: 62H15
Secondary: 62Q05

Keywords: Adaptive procedure , discrete hypothesis testing , False discovery rate , heterogeneous data , step-down algorithm , step-up algorithm , type I error rate control

Vol.12 • No. 1 • 2018
Back to Top