Raking-ratio empirical process with auxiliary information learning

Abstract

The raking-ratio method is a statistical and computational method which adjusts the empirical measure to match the true probability of sets of a finite partition. The asymptotic behavior of the raking-ratio empirical process indexed by a class of functions is studied when the auxiliary information is given by estimates. These estimates are supposed to result from the learning of the probability of sets of partitions from another sample larger than the sample of the statistician, as in the case of two-stage sampling surveys. Under some metric entropy hypothesis and conditions on the size of the information source sample, the strong approximation of this process and in particular the weak convergence are established. Under these conditions, the asymptotic behavior of the new process is the same as the classical raking-ratio empirical process. Some possible statistical applications of these results are also given, like the strengthening of the Z-test and the chi-square goodness of fit test.