Finding Hidden Cliques of Size $$\sqrt{N/e}$$ N / e in Nearly Linear Time-Reference-Cited by-同舟云学术

Finding Hidden Cliques of Size $$\sqrt{N/e}$$ N / e in Nearly Linear Time

Published:2014-09-09 Issue:4 Volume:15 Page:1069-1128
ISSN:1615-3375
Container-title:Foundations of Computational Mathematics
language:en
Short-container-title:Found Comput Math

Author:

Deshpande Yash,Montanari Andrea

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics,Analysis

Link

http://link.springer.com/content/pdf/10.1007/s10208-014-9215-y.pdf

Reference41 articles.

1. Louigi Addario-Berry, Nicolas Broutin, Luc Devroye, and Gábor Lugosi. On combinatorial testing problems. The Annals of Statistics, 38(5):3063–3092, 2010.

2. Noga Alon, Michael Krivelevich, and Benny Sudakov. Finding a large hidden clique in a random graph. In Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pages 594–598. Society for Industrial and Applied Mathematics, 1998.

3. Noga Alon, Michael Krivelevich, and Van H Vu. On the concentration of eigenvalues of random symmetric matrices. Israel Journal of Mathematics, 131(1):259–267, 2002.

4. Brendan PW Ames and Stephen A Vavasis. Nuclear norm minimization for the planted clique and biclique problems. Mathematical programming, 129(1):69–89, 2011.

5. Dana Angluin. Local and global properties in networks of processors. In Proceedings of the twelfth annual ACM symposium on Theory of computing, pages 82–93. ACM, 1980.

Cited by 47 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The landscape of the planted clique problem: Dense subgraphs and the overlap gap property;The Annals of Applied Probability;2024-08-01

2. Detecting planted partition in sparse multilayer networks;Information and Inference: A Journal of the IMA;2024-07-01

3. Planted Clique Conjectures Are Equivalent;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. How to Hide a Clique?;Theory of Computing Systems;2024-04-05

5. Limits and Performances of Algorithms Based on Simulated Annealing in Solving Sparse Hard Inference Problems;Physical Review X;2023-04-20