등복제 설계의 불완전 U-통계량: Berry-Esseen 한계와 효율적 구성
Incomplete U-Statistics of Equireplicate Designs: Berry-Esseen Bound and Efficient Construction
U-statistics are a fundamental class of estimators that generalize the sample mean and underpin much of nonparametric statistics. Although extensively studied in both statistics and probability, key challenges remain: their high computational cost - addressed partly through incomplete U-statistics - and their non-standard asymptotic behavior in the degenerate case, which typically requires resampling methods for hypothesis testing. This paper presents a novel perspective on U-statistics, grounded in hypergraph theory and combinatorial designs. We identify the dependency graph of an incomplete U-statistic with the line graph of its design hypergraph and use Stein's method to derive Berry-Esseen bounds for deterministic designs under full degeneracy. We further extend these results to studentized statistics using a variance estimator tailored to the fully degenerate setting. The resulting bounds establish Gaussian limits for superlinear design sizes with fixed kernel order and accommodate diverging order under separate conditions. We also develop efficient algorithms for constructing equireplicate designs, a subclass of deterministic designs, which yield minimum-variance incomplete U-statistics in the second-order case. Beyond its theoretical contributions, our framework provides permutation-free alternatives to tests based on fully degenerate U-statistics, as demonstrated in experiments with the two-sample Maximum Mean Discrepancy test and a one-sample mean test based on a higher-order U-statistic.