The control of the false discovery rate in multiple testing under dependency is a research paper published in The Annals of Statistics (2001). On theSindex it has a DataRank of 1.4. It has been cited 10,708 times.
Benjamini and Hochberg suggest that the false discovery rate may\nbe the appropriate error rate to control in many applied multiple testing\nproblems. A simple procedure was given there as an FDR controlling procedure\nfor independent test statistics and was shown to be much more powerful than\ncomparable procedures which control the traditional familywise error rate. We\nprove that this same procedure also controls the false discovery rate when the\ntest statistics have positive regression dependency on each of the test\nstatistics corresponding to the true null hypotheses. This condition for\npositive dependency is general enough to cover many problems of practical\ninterest, including the comparisons of many treatments with a single control,\nmultivariate normal test statistics with positive correlation matrix and\nmultivariate $t$. Furthermore, the test statistics may be discrete, and the\ntested hypotheses composite without posing special difficulties. For all other\nforms of dependency, a simple conservative modification of the procedure\ncontrols the false discovery rate. Thus the range of problems for which a\nprocedure with proven FDR control can be offered is greatly increased.
FAIR checklist signals are shown for context only and do not affect DataRank scoring.
Base Score Contribution
1.4
From this paper's citation signal
Citation Network Contribution
0
Citation network not refreshed for this result
This paper's DataRank is currently driven only by its base citation score. Citation network data was not refreshed for this result.
Learn more about DataRank methodology →DataRank blends this paper's own citation count with the influence of the papers that cite it. Here, roughly 100% comes from its base citations and 0% from the citation network.
Citers are pulled from OpenAlex sorted by cited_by_count:descand capped per paper, so when the cap binds we keep the highest-signal references and the score is reproducible across reruns.