Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dependence correction of multiple tests with applications to sparsity (1909.13727v1)

Published 30 Sep 2019 in math.ST and stat.TH

Abstract: The present paper establishes new multiple procedures for simultaneous testing of a large number of hypotheses under dependence. Special attention is devoted to experiments with rare false hypotheses. This sparsity assumption is typically for various genome studies when a portion of remarkable genes should be detected. The aim is to derive tests which control the false discovery rate (FDR) always at finite sample size. The procedures are compared for the set up of dependent and independent $p$-values. It turns out that the FDR bounds differ by a dependency factor which can be used as a correction quantity. We offer sparsity modifications and improved dependence tests which generalize the Benjamini-Yekutieli test and adaptive tests in the sense of Storey. As a byproduct, an early stopped test is presented in order to bound the number of rejections. The new procedures perform well for real genome data examples.

Summary

We haven't generated a summary for this paper yet.