Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
From MaRDI portal
Publication:2810798
zbMath1360.62320arXiv1402.1267MaRDI QIDQ2810798
Publication date: 6 June 2016
Full work available at URL: https://arxiv.org/abs/1402.1267
Related Items (28)
Tensor clustering with planted structures: statistical optimality and computational limits ⋮ Hierarchical Community Detection by Recursive Partitioning ⋮ Computational barriers to estimation from low-degree polynomials ⋮ Distribution-free detection of a submatrix ⋮ Model assisted variable clustering: minimax-optimal recovery and algorithms ⋮ A goodness-of-fit test on the number of biclusters in a relational data matrix ⋮ Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality ⋮ Compressed spectral screening for large-scale differential correlation analysis with application in selecting glioblastoma gene modules ⋮ Semidefinite programming based community detection for node-attributed networks and multiplex networks ⋮ Bsig: evaluating the statistical significance of biclustering solutions ⋮ The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs ⋮ On semidefinite relaxations for the block model ⋮ Submatrix localization via message passing ⋮ Community Detection and Stochastic Block Models ⋮ Distribution-Free, Size Adaptive Submatrix Detection with Acceleration ⋮ Recovering a hidden community beyond the Kesten–Stigum threshold in O(|E|log*|V|) time ⋮ Convex relaxation methods for community detection ⋮ Nonreconstruction of high-dimensional stochastic block model with bounded degree ⋮ Community detection in sparse networks via Grothendieck's inequality ⋮ Statistical and computational tradeoff in genetic algorithm-based estimation ⋮ On the estimation of latent distances using graph distances ⋮ Exact recovery in the hypergraph stochastic block model: a spectral algorithm ⋮ The overlap gap property in principal submatrix recovery ⋮ Analysis of spectral clustering algorithms for community detection: the general bipartite setting ⋮ Partial recovery bounds for clustering with the relaxed \(K\)-means ⋮ Covariate Regularized Community Detection in Sparse Graphs ⋮ Unnamed Item ⋮ Global and individualized community detection in inhomogeneous multilayer networks
Uses Software
This page was built for publication: Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
