A combinatorial error bound for t-point-based sampling

Authors:
P. Dukes;Alan C. H. Ling
Affiliations:
Department of Mathematics, California Institute of Technology, Pasadena, CA;Department of Electrical Engineering and Computer Science, University of Vermont, Burlington, VT
Venue:
Theoretical Computer Science
Year:
2004

Citing 3
Cited 0

On the power of two-point based sampling

Journal of Complexity
On randomization in sequential and distributed algorithms

ACM Computing Surveys (CSUR)
A simple analysis of the error probability of two-point based sampling

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

The method of two-point-based sampling using orthogonal arrays (Inform. Process. Lett. 60 (1996) 91) is extended to consider t-wise independent sampling using orthogonal arrays of higher strength t. Using combinatorial considerations, an error bound is calculated which agrees with the previously known result when t = 2, and has the advantage of exponentially decreasing in t. The result is shown to be strictly sharper than that arising from the generalized Chebyshev inequality. Finally, the behavior of the family of error bounds we obtain for increasing values of t is analyzed.