This article establishes novel strong uniform laws of large numbers for randomly weighted sums such as bootstrap means. By leveraging recent advances, these results extend previous work in their general applicability to a wide range of weighting procedures and in their flexibility with respect to the effective bootstrap sample size. In addition to the standard multinomial bootstrap and the $m$-out-of-$n$ bootstrap, our results apply to a large class of randomly weighted sums involving negatively orthant dependent (NOD) weights, including the Bayesian bootstrap, jackknife, resampling without replacement, simple random sampling with over-replacement, independent weights, and multivariate Gaussian weighting schemes. Weights are permitted to be non-identically distributed and possibly even negative. Our proof technique is based on extending a proof of the i.i.d.\ strong uniform law of large numbers to employ strong laws for randomly weighted sums; in particular, we exploit a recent Marcinkiewicz--Zygmund strong law for NOD weighted sums.
翻译:本条为随机加权总和(如靴子陷阱)确立了数量众多、数量众多、具有任意性的新强的统一法则。通过利用最近的进展,这些结果扩大了以往的工作,使其在一般情况下适用于广泛的加权程序,并在有效的靴子陷阱样本大小方面具有灵活性。除了标准的多数值靴陷阱和美元出于一美元靴子陷阱之外,我们的结果适用于一大类随机加权数额,涉及负或超依赖(NOD)重量,包括巴伊西亚靴子陷阱、千刀、无替代地重新采样、与超重替换、独立重量和多变量高斯加权计划进行简单随机抽样。允许加权不明显分布,甚至可能是负值。我们的证据技术的基础是扩大i.d.d.和大数字的有力统一法则,以对随机加权总和适用强有力的法律;特别是,我们利用了最近一项Marcinkiewicz-Zygmund的强法则用于NOD加权。