Finding hidden cliques in linear time with high probability

8th Workshop on Analytic Algorithmics and Combinatorics 2011, ANALCO 2011

Volumn , Issue , 2011, Pages 67-75

  Dekel, Yael ^a   Gurel Gurevich, Ori ^b   Peres, Yuval ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; PROBABILITY;

CLIQUE PROBLEMS; FAILURE PROBABILITY; HIGH PROBABILITY; POLYNOMIAL-TIME; RANDOM GRAPH MODELS; RANDOM SUBSETS; RUNNING TIME; SPECTRAL TECHNIQUES;

GRAPH THEORY;

EID: 84959922759     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973013.8     Document Type: Conference Paper

References (25)

1. M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Dover Publications, New York, 1964.
2. N. Alon, A. Andoni, T. Kaufman, K. Matulef, R. Rubinfeld and N. Xie, Testing κ-wise and almost k-wise independence, STOC 2007, pp. 496-505.
3. N. Alon, M. Krivelevich and B. Sudakov, Finding a large hidden clique in a random graph, Random Structures and Algorithms, 13 (1998), pp. 457-466.
4. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof Verification and Hardness of Approximation Problems, FOCS 1992, pp. 14-23.
5. S. Arora and S. Safra, Probabilistic Checking of Proofs: A New Characterization of NP, J. ACM, 45(1) (1998, pp. 70-122.
6. A. Ben-Dor, R. Shamir and Z. Yakhini, Clustering Gene Expression Patterns, Journal of Computational Biology, 6(3/4) (1999), pp. 281-297.
7. E. Ben Sasson, Y. Bilu and D. Gutfreund, Finding a randomly planted assignment in a random 3CNF, manuscript, 2002.
8. A. C. Berry, The accuracy of the Gaussian approximation to the sum of independent variates, Transactions of the american mathematical society, 49(1) (1941), pp. 122-136.
9. R. Durrett, Probability: Theory and Examples, Cambridge University Press, fourth edition, 2010.
10. C. G. Esseen, On the Liapunoff limit of error in the theory of probability, Arkiv for matematik, astronomi och fysik, A28 (1942), pp. 1-19.
11. U. Feige, S. Goldwasser, L. Lovãsz, S. Safra and M. Szegedy, Approximating Clique is Almost NP-Complete (Preliminary Version), FOCS 1991, pp. 2-12.
12. U. Feige and R. Krauthgamer, Finding and certifying a large hidden clique in a semirandom graph, Random Struct. Algorithms, 16(2) (2000), pp. 195-208.
13. U. Feige and R. Krauthgamer, The Probable Value of the Lovász-Schrijver Relaxations for Maximum Independent Set, SIAM J. Comput, 32(2) (2003), pp. 345-370.
14. U. Feige and D. Ron, Finding hidden cliques in linear time, AOFA, 2010.
15. A. M. Frieze and R. Kannan, A new approach to the planted clique problem, FSTTCS, 2008, pp. 187-198,
16. G. Grimmett and C. McDiarmid, On colouring random graphs, Math. Proc. Cam. Phil. Soc, 77 (1975), pp. 313-324.
17. E. Hazan and R. Krauthgamer, How hard is it to approximate the best Nash equilibrium?, SODA 2009, pp. 720-727.
18. M. Jerrum, Large cliques elude the metropolis process, Random Structures and Algorithms, 3 (1992), pp. 347-359.
19. A. Juels and M. Peinado, Hiding Cliques for Cryptographic Security, Des. Codes Cryptography, 20(3) (2000), pp. 269-280.
20. R. M. Karp, Reducibility among combinatorial problems, in Complexity of computer computations, editors R. E. Miller and J. W. Thatcher, pp. 85-103, Plenum Press, New York, 1972.
21. M. Krivelevich and D. Vilenchik, Solving random satisfiable SCNF formulas in expected polynomial time, SODA 2006, pp. 454-463.
22. L. Kucera, A Generalized Encryption Scheme Based on Random Graphs, in Volume 570 of Lecture Notes in Computer Science, Editors G. Schmidt and R. Berghammer, Springer, 1991, pp. 180-186.
23. L. Kucera, Expected complexity of graph partitioning problems, Discrete Applied Math., 57 (1995), pp. 193-212.
24. C. McDiarmid, On the method of bounded differences, Surveys in combinatorics, pp. 148-188, Cambridge University Press, 1989.
25. F. McSherry, Spectral Partitioning of Random Graphs, FOCS, 2001, pp. 529-537.