The following pages link to (Q2959905):
Displayed 17 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Optimal detection of sparse principal components in high dimension (Q385763) (← links)
- Community detection in sparse random networks (Q894814) (← links)
- Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557) (← links)
- A simple spectral algorithm for recovering planted partitions (Q1678989) (← links)
- Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
- On the hardness of designing public signals (Q2278949) (← links)
- Computational barriers in minimax submatrix detection (Q2352736) (← links)
- Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) (← links)
- Community detection in dense random networks (Q2510823) (← links)
- A Simple SVD Algorithm for Finding Hidden Partitions (Q4601058) (← links)
- Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log<sup>*</sup>|<i>V</i>|) time (Q4684942) (← links)
- Finding a planted clique by adaptive probing (Q5126325) (← links)
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
- Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs (Q5234663) (← links)
- Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)