Testing k-wise and almost k-wise independence

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 496-505

  Alon, Noga ^a   Andoni, Alexandr ^b   Kaufman, Tali ^b   Matulef, Kevin ^b   Rubinfeld, Ronitt ^b   Xie, Ning ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY AT BUFFALO   (United States)

Author keywords

Almost k wise independence; Fourier analysis; Hidden clique; K wise independence; Property testing

Indexed keywords

HIDDEN CLIQUE; K-WISE INDEPENDENCE; PROPERTY TESTING;

ALGORITHMS; FOURIER ANALYSIS; GRAPH THEORY; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING;

COMPUTATIONAL METHODS;

EID: 35448996909     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250863     Document Type: Conference Paper

References (26)

1. N. Alon. Problems and results in extremal combinatorics (Part I). Discrete Math., 273:31-53, 2003.
2. N. Alon, L. Babai, and A. Itai. A fast and simple randomized algorithm for the maximal independent set problem. J. of Algorithms, 7:567-583, 1986.
3. N. Alon, O. Goldreich, J. Håstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms, 3(3):289-304, 1992. Earlier version in FOCS'90.
4. N. Alon, O. Goldreich, and Y. Mansour. Almost k-wise independence versus k-wise independence. Inform. Process. Lett., 88:107-110, 2003.
5. N. Alon, M. Krivelevich, and B. Sudakov. Finding a large hidden clique in a random graph. Random Structures and Algorithms, 13:457-466, 1998.
6. N. Alon and J. Spencer. The Probabilistic Method. John Wiley and Sons, second edition, 2000.
7. T. Batu, E. Fisher, L. Fortnow, R. Kumar, R. Rubinfeld, and P. White. Testing random variables for independence and identity. In Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 442-451, 2001.
8. T. Batu, L. Fortnow, R. Rubinfeld, W. D. Smith, and P. White. Testing that distributions are close. In Proc. 41st Annual IEEE Symposium on Foundations of Computer Science, pages 189-197, 2000.
9. T. Batu, R. Kumar, and R. Rubinfeld. Sublinear algorithms for testing monotone and unimodal distributions. In Proc. 36th Annual ACM Symposium on the Theory of Computing, pages 381-390, New York, NY, USA, 2004. ACM Press.
10. W. Beckner. Inequalities in fourier analysis. Annals of Mathematics, 102:159-182, 1975.
11. S. Bernstein. The Theory of Probabilities. Gostehizdat Publishing House, Moscow, 1946.
12. P(g). Ann. Inst. Fourier (Grenoble), 20(2):335-402, 1970.
13. B. Chor, J. Friedman, O. Goldreich, J. Håstad, S. Rudich, and R. Smolensky. The bit extraction problem and t-resilient functions. In Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, pages 396-407, 1985.
14. I. Dinur, E. Friedgut, G. Kindler, and R. O'Donnell. On the Fourier tails of bounded functions over the discrete cube. In Proc. 38th Annual ACM Symposium on the Theory of Computing, pages 437-446, New York, NY, USA, 2006. ACM Press.
15. U. Feige and R. Krauthgamer. Finding and certifying a large hidden clique in a semirandom graph. Random Structures and Algorithms, 16:195-208, 2000.
16. A. Frieze and C. McDiarmid. Algorithmic theory of random graphs. Random Structures and Algorithms, 10(1-2):5-42, 1997.
17. O. Goldreich and D. Ron. On testing expansion in bounded-degree graphs. Technical Report TR00-020, Electronic Colloquium on Computational Complexity, 2000.
18. M. Jerrum. Large cliques elude the metropolis process. Random Structures and Algorithms, 3(4):347-359, 1992.
19. A. Joffe. On a set of almost deterministic k-independent random variables. Annals of Probability, 2:161-162, 1974.
20. A. Juels and M. Peinado. Hiding cliques for cryptographic security. Des. Codes Cryptography, 20(3):269-280, 2000.
21. R. Karp and A. Wigderson. A fast parallel algorithm for the maximal independent set problem. Journal of the ACM, 32(4):762-773, 1985.
22. R. M. Karp. The probabilistic analysis of some combinatorial search algorithms. In J. F. Traub, editor, Algorithms and Complexity: New directions and Recent Results, pages 1-19, New York, 1976. Academic Press.
23. L. Kučera. Expected complexity of graph partitioning problems. Disc. Applied Math., 57(2-3):193-212, 1995.
24. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. on Comput., 15(4):1036-1053, 1986. Earlier version in STOC'85.
25. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. SIAM J. on Comput., 22(4):838-856, 1993. Earlier version in STOC'90.
26. R. Rubinfeld and R. A. Servedio. Testing monotone high-dimensional distributions. In Proc. 37th Annual ACM Symposium on the Theory of Computing, pages 147-156, New York, NY, USA, 2005. ACM Press.