Random tensors and planted cliques

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 406-419

  Brubaker, S Charles ^a   Vempala, Santosh S ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; CONCENTRATION OF MEASURE; PROOF METHODS; RANDOM GRAPHS; RANDOM TENSORS; SUBGRAPHS;

AGRICULTURE; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; MATRIX ALGEBRA; TECHNICAL PRESENTATIONS; TENSORS;

GRAPH THEORY;

EID: 70350603036     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_31     Document Type: Conference Paper

References (9)

1. Frieze, A., Kannan, R.: A new approach to the planted clique problem. In: Proc. of FST & TCS (2008)
2. Karp, R.: The probabilistic analysis of some combinatorial search algorithms. In: Algorithms and Complexity: New Directions and Recent Results, pp. 1-19. Academic Press, London (1976)
3. Jerrum, M.: Large cliques elude the metropolis process. Random Structures and Algorithms 3(4), 347-360 (1992)
4. Kucera, L.: Expected complexity of graph partitioning problems. Discrete Applied Mathematics 57, 193-212 (1995)
5. Alon, N., Krivelevich, M., Sudakov, B.: Finding a large hidden clique in a random graph. Random Structures and Algorithms 13, 457-466 (1998)
6. McSherry, F.: Spectral partitioning of random graphs. In: Proc. of FOCS, pp. 529-537 (2001)
7. Feige, U., Krauthgamer, R.: Finding and certifying a large hidden clique in a semi-random graph. Random Structures and Algorithms 16(2), 195-208 (2000)
8. Füredi, Z., Komlós, J.: The eigenvalues of random symmetric matrices. Combinatorica 1(3), 233-241 (1981)
9. Vu, V.H.: Spectral norm of random matrices. In: Proc. of STOC, pp. 423-430 (2005)