1974/01/01 by R. J. Serfling · 9 citations
Mathematics · Computer Science · #Advanced Statistical Methods and Models #Survey Sampling and Estimation Techniques #Bayesian Methods and Mixture Models #Mathematics #Statistics #Statistic #Upper and lower bounds #Moment (physics) #Sample size determination #Applied mathematics #Martingale (probability theory) #Exponential function #Population #Inequality #Sampling (signal processing) #Combinatorics #Mathematical analysis
paper · pdf · doi:10.1214/aos/1176342611
openalex publication_date 1974/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
Upper bounds are established for the probability that, in sampling without replacement from a finite population, the sample sum exceeds its expected value by a specified amount. These are obtained as corollaries of two main results. Firstly, a useful upper bound is derived for the moment generating function of the sum, leading to an exponential probability inequality and related moment inequalities. Secondly, maximal inequalities are obtained, extending Kolmogorov's inequality and the Hajek-Renyi inequality. Compared to sampling with replacement, the results incorporate sharpenings reflecting the influence of the sampling fraction, n/N, where n denotes the sample size and N the population size. We go somewhat beyond previous work by Hoeffding (1963) and Sen (1970). As in the latter reference, martingale techniques are exploited. Applications to simple linear rank statistics are noted, dealing with the two-sample Wilcoxon statistic as an example. Finally, the question of sharpness of the exponential bounds is considered.