{"list":"other","total":64,"rows":[{"id":"1703.10146","title":"Community Detection and Stochastic Block Models","created":"2017-03-29","cited_by_count":319},{"id":"1312.2050","title":"Consistency of spectral clustering in stochastic block models","created":"2013-12-07","cited_by_count":129},{"id":"1611.03473","title":"Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures","created":"2016-11-10","cited_by_count":115},{"id":"1907.11636","title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","created":"2019-07-26","cited_by_count":85},{"id":"1405.3267","title":"Exact Recovery in the Stochastic Block Model","created":"2014-05-13","cited_by_count":78},{"id":"1806.00040","title":"Efficient Algorithms and Lower Bounds for Robust Linear Regression","created":"2018-05-31","cited_by_count":76},{"id":"1710.05017","title":"The power of sum-of-squares for detecting hidden structures","created":"2017-10-13","cited_by_count":54},{"id":"1703.02724","title":"Tensor SVD: Statistical and Computational Limits","created":"2017-03-08","cited_by_count":53},{"id":"2005.08099","title":"Reducibility and Statistical-Computational Gaps from Secret Leakage","created":"2020-05-16","cited_by_count":51},{"id":"2009.06107","title":"Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent","created":"2020-09-13","cited_by_count":51},{"id":"1311.3085","title":"Community detection thresholds and the weak Ramanujan property","created":"2013-11-13","cited_by_count":47},{"id":"1907.11635","title":"Subexponential-Time Algorithms for Sparse PCA","created":"2019-07-26","cited_by_count":41},{"id":"1311.1731","title":"Stochastic blockmodel approximation of a graphon: Theory and consistent estimation","created":"2013-11-07","cited_by_count":39},{"id":"2008.02269","title":"Computational Barriers to Estimation from Low-Degree Polynomials","created":"2020-08-05","cited_by_count":39},{"id":"1402.1888","title":"A Consistent Histogram Estimator for Exchangeable Graph Models","created":"2014-02-08","cited_by_count":37},{"id":"1311.4115","title":"A Proof Of The Block Model Threshold Conjecture","created":"2013-11-17","cited_by_count":36},{"id":"1505.03772","title":"Achieving Optimal Misclassification Proportion in Stochastic Block Model","created":"2015-05-14","cited_by_count":35},{"id":"1806.07508","title":"Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure","created":"2018-06-19","cited_by_count":35},{"id":"1510.05610","title":"Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues","created":"2015-10-19","cited_by_count":32},{"id":"2205.09727","title":"The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics","created":"2022-05-19","cited_by_count":31},{"id":"1902.07324","title":"Computational Hardness of Certifying Bounds on Constrained PCA Problems","created":"2019-02-19","cited_by_count":30},{"id":"2005.10743","title":"Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits","created":"2020-05-21","cited_by_count":30},{"id":"1402.1267","title":"Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices","created":"2014-02-06","cited_by_count":29},{"id":"1509.08588","title":"Estimating network edge probabilities by neighborhood smoothing","created":"2015-09-29","cited_by_count":28},{"id":"1709.03183","title":"Rates of Convergence of Spectral Methods for Graphon Estimation","created":"2017-09-10","cited_by_count":28},{"id":"1408.5369","title":"Statistical and computational trade-offs in estimation of sparse principal components","created":"2014-08-22","cited_by_count":26},{"id":"1409.8565","title":"Sparse CCA: Adaptive Estimation and Computational Barriers","created":"2014-09-30","cited_by_count":25},{"id":"1507.05313","title":"Minimax Rates of Community Detection in Stochastic Block Models","created":"2015-07-19","cited_by_count":25},{"id":"1407.1591","title":"Consistency Thresholds for the Planted Bisection Model","created":"2014-07-07","cited_by_count":24},{"id":"1304.1831","title":"Limits of local algorithms over sparse random graphs","created":"2013-04-05","cited_by_count":23},{"id":"1406.6625","title":"Computational Lower Bounds for Community Detection on Random Graphs","created":"2014-06-25","cited_by_count":22},{"id":"1411.4686","title":"Community detection in sparse networks via Grothendieck's inequality","created":"2014-11-17","cited_by_count":21},{"id":"2105.15081","title":"Optimal Spectral Recovery of a Planted Vector in a Subspace","created":"2021-05-31","cited_by_count":21},{"id":"1312.5306","title":"Network histograms and universality of blockmodel approximation","created":"2013-12-18","cited_by_count":20},{"id":"1702.00467","title":"The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness","created":"2017-02-01","cited_by_count":20},{"id":"1506.06162","title":"Private Graphon Estimation for Sparse Graphs","created":"2015-06-19","cited_by_count":17},{"id":"1601.02658","title":"Information-theoretic thresholds for community detection in sparse networks","created":"2016-01-11","cited_by_count":17},{"id":"2010.06563","title":"Optimal Low-Degree Hardness of Maximum Independent Set","created":"2020-10-13","cited_by_count":16},{"id":"1501.05021","title":"Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery","created":"2015-01-20","cited_by_count":15},{"id":"2206.08756","title":"Tensor-on-Tensor Regression: Riemannian Optimization, Over-parameterization, Statistical-computational Gap, and Their Interplay","created":"2022-06-17","cited_by_count":15},{"id":"1311.4821","title":"On the Complexity of Random Satisfiability Problems with Planted Solutions","created":"2013-11-19","cited_by_count":14},{"id":"1911.01960","title":"Local Statistics, Semidefinite Programming, and Community Detection","created":"2019-11-05","cited_by_count":14},{"id":"2106.02129","title":"The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials","created":"2021-06-03","cited_by_count":14},{"id":"2110.01602","title":"Clustering a Mixture of Gaussians with Unknown Covariance","created":"2021-10-04","cited_by_count":14},{"id":"2009.02609","title":"Isotonic regression with unknown permutations: Statistics, computation, and adaptation","created":"2020-09-05","cited_by_count":13},{"id":"1502.01988","title":"Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix","created":"2015-02-06","cited_by_count":12},{"id":"1512.00150","title":"Optimal Estimation and Completion of Matrices with Biclustering Structures","created":"2015-12-01","cited_by_count":12},{"id":"2005.10817","title":"Computationally efficient sparse clustering","created":"2020-05-21","cited_by_count":12},{"id":"2303.18156","title":"Large Dimensional Independent Component Analysis: Statistical Optimality and Computational Tractability","created":"2023-03-31","cited_by_count":12},{"id":"1810.00315","title":"Convex Relaxation Methods for Community Detection","created":"2018-09-30","cited_by_count":11},{"id":"1904.09635","title":"Achieving the Bayes Error Rate in Synchronization and Block Models by SDP, Robustly","created":"2019-04-21","cited_by_count":11},{"id":"1408.0856","title":"Convex Biclustering","created":"2014-08-05","cited_by_count":10},{"id":"1507.06370","title":"Sum-of-Squares Lower Bounds for Sparse PCA","created":"2015-07-23","cited_by_count":10},{"id":"2109.06915","title":"Reconstruction on Trees and Low-Degree Polynomials","created":"2021-09-14","cited_by_count":10},{"id":"1811.06055","title":"Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing","created":"2018-11-14","cited_by_count":8},{"id":"1703.08085","title":"Reducing Crowdsourcing to Graphon Estimation, Statistically","created":"2017-03-23","cited_by_count":7},{"id":"2303.02118","title":"Statistical-Computational Tradeoffs in Mixed Sparse Linear Regression","created":"2023-03-03","cited_by_count":7},{"id":"2201.09040","title":"Optimal Estimation and Computational Limit of Low-rank Gaussian Mixtures","created":"2022-01-22","cited_by_count":6},{"id":"2211.05274","title":"Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials","created":"2022-11-10","cited_by_count":6},{"id":"2302.06737","title":"Detection-Recovery Gap for Planted Dense Cycles","created":"2023-02-13","cited_by_count":4},{"id":"1507.06352","title":"Co-clustering of Nonsmooth Graphons","created":"2015-07-22","cited_by_count":2},{"id":"2203.13304","title":"Stochastic Block Smooth Graphon Model","created":"2022-03-24","cited_by_count":2},{"id":"2304.03590","title":"Graphon Estimation in bipartite graphs with observable edge labels and unobservable node labels","created":"2023-04-07","cited_by_count":2},{"id":"2303.05024","title":"Phase transition for detecting a small community in a large network","created":"2023-03-09","cited_by_count":1}],"next_cursor":null}