Validity and Power of Heavy-Tailed Combination Tests under Asymptotic Dependence

Abstract

Heavy-tailed combination tests, such as the Cauchy combination test and harmonic mean p-value method, are widely used for testing global null hypotheses by aggregating dependent p-values. Existing theoretical guarantees, however, are largely restricted to the case of asymptotically independent p-values, leaving the behavior of these tests under broader dependence structures poorly understood. We develop a unified framework based on multivariate regularly varying copulas, a flexible class defined by a mild regularity condition on the joint behavior of p-values near zero, that accommodates a wide range of dependence structures. Within this framework, heavy-tailed combination tests are asymptotically valid when the transformation distribution has tail index $\gamma \leq 1$, with $\gamma = 1$ maximizing power while preserving validity. We further show that combination tests with $\gamma = 1$ achieve strictly greater asymptotic power than Bonferroni's method if and only if the p-values are not asymptotically independent and signals are not extremely sparse, with the power advantage growing as dependence strengthens. Bonferroni emerges as the $\gamma \to 0$ limit and becomes overly conservative under asymptotic dependence. These results provide theoretical support for using truncated Cauchy or Pareto combination tests, offering a principled approach to enhance power while controlling false positives under complex dependence.