Pages that link to "Item:Q2810798"

The following pages link to Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices (Q2810798):

Displaying 27 items.

• Community detection in sparse networks via Grothendieck's inequality (Q737326) (← links)
• Bsig: evaluating the statistical significance of biclustering solutions (Q1741369) (← links)
• On semidefinite relaxations for the block model (Q1747735) (← links)
• Convex relaxation methods for community detection (Q2038282) (← links)
• On the estimation of latent distances using graph distances (Q2044319) (← links)
• The overlap gap property in principal submatrix recovery (Q2067659) (← links)
• Global and individualized community detection in inhomogeneous multilayer networks (Q2105190) (← links)
• Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
• Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
• Model assisted variable clustering: minimax-optimal recovery and algorithms (Q2176610) (← links)
• Nonreconstruction of high-dimensional stochastic block model with bounded degree (Q2288830) (← links)
• Exact recovery in the hypergraph stochastic block model: a spectral algorithm (Q2310389) (← links)
• Partial recovery bounds for clustering with the relaxed \(K\)-means (Q2319817) (← links)
• Distribution-free detection of a submatrix (Q2400812) (← links)
• Community Detection and Stochastic Block Models (Q4558502) (← links)
• Submatrix localization via message passing (Q4558513) (← links)
• Analysis of spectral clustering algorithms for community detection: the general bipartite setting (Q4633061) (← links)
• Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log^*|<i>V</i>|) time (Q4684942) (← links)
• Statistical and computational tradeoff in genetic algorithm-based estimation (Q4960741) (← links)
• Covariate Regularized Community Detection in Sparse Graphs (Q4999151) (← links)
• Distribution-Free, Size Adaptive Submatrix Detection with Acceleration (Q5110726) (← links)
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
• (Q5159420) (← links)
• Hierarchical Community Detection by Recursive Partitioning (Q5885119) (← links)
• A goodness-of-fit test on the number of biclusters in a relational data matrix (Q6058528) (← links)
• Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality (Q6072327) (← links)
• Compressed spectral screening for large-scale differential correlation analysis with application in selecting glioblastoma gene modules (Q6138655) (← links)