Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Krauthgamer, Robert
Nadler, Boaz
and
Vilenchik, Dan
2015.
Do semidefinite relaxations solve sparse PCA up to the information limit?.
The Annals of Statistics,
Vol. 43,
Issue. 3,
Meka, Raghu
Potechin, Aaron
and
Wigderson, Avi
2015.
Sum-of-squares Lower Bounds for Planted Clique.
p.
87.
Ames, Brendan P. W.
2015.
Guaranteed Recovery of Planted Cliques and Dense Subgraphs by Convex Relaxation.
Journal of Optimization Theory and Applications,
Vol. 167,
Issue. 2,
p.
653.
Montanari, Andrea
2015.
Finding One Community in a Sparse Graph.
Journal of Statistical Physics,
Vol. 161,
Issue. 2,
p.
273.
Hajek, Bruce
Wu, Yihong
and
Xu, Jiaming
2016.
Information limits for recovering a hidden community.
p.
1894.
Hajek, Bruce
Wu, Yihong
and
Xu, Jiaming
2017.
Information Limits for Recovering a Hidden Community.
IEEE Transactions on Information Theory,
Vol. 63,
Issue. 8,
p.
4729.
Montanari, Andrea
Reichman, Daniel
and
Zeitouni, Ofer
2017.
On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors.
IEEE Transactions on Information Theory,
Vol. 63,
Issue. 3,
p.
1572.
Hopkins, Samuel B.
Kothari, Pravesh
Potechin, Aaron Henry
Raghavendra, Prasad
and
Schramm, Tselil
2018.
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique.
ACM Transactions on Algorithms,
Vol. 14,
Issue. 3,
p.
1.
Hajek, Bruce
Wu, Yihong
and
Xu, Jiaming
2018.
Recovering a hidden community beyond the Kesten–Stigum threshold in O(|E|log*|V|) time.
Journal of Applied Probability,
Vol. 55,
Issue. 2,
p.
325.
Chen, Lijie
and
Grossman, Ofer
2019.
Broadcast Congested Clique.
p.
248.
Boix-Adsera, Enric
Brennan, Matthew
and
Bresler, Guy
2019.
The Average-Case Complexity of Counting Cliques in Erdős-Rényi Hypergraphs.
p.
1256.
Leitch, Jack
Alexander, Kathleen A.
and
Sengupta, Srijan
2019.
Toward epidemic thresholds on temporal networks: a review and open questions.
Applied Network Science,
Vol. 4,
Issue. 1,
Rácz, Miklós Z.
and
Schiffer, Benjamin
2020.
Finding a planted clique by adaptive probing
.
Latin American Journal of Probability and Mathematical Statistics,
Vol. 17,
Issue. 2,
p.
775.
Bogerd, Kay
Castro, Rui M.
and
van der Hofstad, Remco
2020.
Cliques in rank-1 random graphs: The role of inhomogeneity.
Bernoulli,
Vol. 26,
Issue. 1,
Bombina, Polina
and
Ames, Brendan
2020.
Convex Optimization for the Densest Subgraph and Densest Submatrix Problems.
SN Operations Research Forum,
Vol. 1,
Issue. 3,
Hillar, Christopher
Chan, Tenzin
Taubman, Rachel
and
Rolnick, David
2021.
Hidden Hypergraphs, Error-Correcting Codes, and Critical Learning in Hopfield Networks.
Entropy,
Vol. 23,
Issue. 11,
p.
1494.
Wu, Yihong
and
Xu, Jiaming
2021.
Information-Theoretic Methods in Data Science.
p.
383.
Boix-Adserà, Enric
Brennan, Matthew
and
Bresler, Guy
2021.
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs.
SIAM Journal on Computing,
p.
FOCS19-39.
Huleihel, Wasim
2022.
Inferring Hidden Structures in Random Graphs.
IEEE Transactions on Signal and Information Processing over Networks,
Vol. 8,
Issue. ,
p.
855.
Luo, Yuetian
and
Zhang, Anru R.
2022.
Tensor clustering with planted structures: Statistical optimality and computational limits.
The Annals of Statistics,
Vol. 50,
Issue. 1,