Testing k-wise and almost k-wise independence

  title={Testing k-wise and almost k-wise independence},
  author={Noga Alon and Alexandr Andoni and Tali Kaufman and Kevin Matulef and Ronitt Rubinfeld and Ning Xie},
In this work, we consider the problems of testing whether adistribution over (0,1<sup>n</sup>) is <i>k</i>-wise (resp. (ε,k)-wise) independentusing samples drawn from that distribution. For the problem of distinguishing <i>k</i>-wise independent distributions from those that are δ-far from <i>k</i>-wise independence in statistical distance, we upper bound the number ofrequired samples by Õ(n<sup>k</sup>/δ<sup>2</sup>) and lower bound it by Ω(n<sup>k-1/2</sup>/δ) (these bounds hold for constant… CONTINUE READING
Highly Cited
This paper has 128 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.

129 Citations

Citations per Year
Semantic Scholar estimates that this publication has 129 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-4 of 4 references

Almost k-wise independence versus k-wise independence

Inf. Process. Lett. • 2002
View 10 Excerpts
Highly Influenced

Inequalities in fourier analysis on R.

Proceedings of the National Academy of Sciences of the United States of America • 1975
View 8 Excerpts
Highly Influenced

Etude des coefficients fourier des fonctiones de l(g)

A. Bonami
Ann. Inst. Fourier (Grenoble), • 1970
View 8 Excerpts
Highly Influenced

Large Cliques Elude the Metropolis Process

Random Struct. Algorithms • 1992
View 4 Excerpts
Highly Influenced