{"total":28,"rows":[{"id":"2304.08135","title":"Detection of Dense Subhypergraphs by Low-Degree Polynomials","created":"2023-04-17","cited_by_count":7,"area":null},{"id":"2308.15728","title":"Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials","created":"2023-08-30","cited_by_count":6,"area":null},{"id":"2101.12336","title":"Community Detection in the Stochastic Block Model by Mixed Integer Programming","created":"2021-01-26","cited_by_count":5,"area":null},{"id":"2212.10872","title":"Is it easier to count communities than find them?","created":"2022-12-21","cited_by_count":5,"area":null},{"id":"2511.21526","title":"Phase Transition for Stochastic Block Model with more than $\\sqrt{n}$ Communities (II)","created":"2025-11-26","cited_by_count":4,"area":null},{"id":"2105.02816","title":"Semidefinite Programming for Community Detection with Side Information","created":"2021-05-06","cited_by_count":3,"area":null},{"id":"2110.00744","title":"Random Subgraph Detection Using Queries","created":"2021-10-02","cited_by_count":3,"area":null},{"id":"2509.15822","title":"Phase Transition for Stochastic Block Model with more than $\\sqrt{n}$ Communities","created":"2025-09-19","cited_by_count":3,"area":null},{"id":"2102.04439","title":"Community Detection: Exact Recovery in Weighted Graphs","created":"2021-02-08","cited_by_count":2,"area":null},{"id":"2104.10347","title":"A class of network models recoverable by spectral clustering","created":"2021-04-21","cited_by_count":2,"area":null},{"id":"2105.13504","title":"Lattice partition recovery with dyadic CART","created":"2021-05-27","cited_by_count":2,"area":null},{"id":"2110.01901","title":"Inferring Hidden Structures in Random Graphs","created":"2021-10-05","cited_by_count":2,"area":null},{"id":"2111.12550","title":"A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental Limits","created":"2021-11-19","cited_by_count":2,"area":null},{"id":"2302.03658","title":"Planted Bipartite Graph Detection","created":"2023-02-07","cited_by_count":2,"area":null},{"id":"2303.05909","title":"A pseudo-likelihood approach to community detection in weighted networks","created":"2023-03-10","cited_by_count":2,"area":null},{"id":"2305.15430","title":"Bounded Projection Matrix Approximation with Applications to Community Detection","created":"2023-05-21","cited_by_count":2,"area":null},{"id":"2210.15277","title":"Implications of sparsity and high triangle density for graph representation learning","created":"2022-10-27","cited_by_count":1,"area":null},{"id":"2301.04088","title":"Community Detection with Known, Unknown, or Partially Known Auxiliary Latent Variables","created":"2023-01-08","cited_by_count":1,"area":null},{"id":"2303.05024","title":"Phase transition for detecting a small community in a large network","created":"2023-03-09","cited_by_count":1,"area":null},{"id":"2505.18372","title":"Optimal community detection in dense bipartite graphs","created":"2025-05-23","cited_by_count":1,"area":null},{"id":"2102.11658","title":"A Goodness-of-fit Test on the Number of Biclusters in a Relational Data Matrix","created":"2021-02-23","cited_by_count":0,"area":null},{"id":"2107.11886","title":"Logspace Reducibility From Secret Leakage Planted Clique","created":"2021-07-25","cited_by_count":0,"area":null},{"id":"2107.14442","title":"Distribution free optimality intervals for clustering","created":"2021-07-30","cited_by_count":0,"area":null},{"id":"2205.11677","title":"Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold","created":"2022-05-24","cited_by_count":0,"area":null},{"id":"2405.16598","title":"Regularized Projection Matrix Approximation with Applications to Community Detection","created":"2024-05-26","cited_by_count":0,"area":null},{"id":"2508.02158","title":"Robust Detection of Planted Subgraphs in Semi-Random Models","created":"2025-08-04","cited_by_count":0,"area":null},{"id":"2512.21111","title":"Statistical and computational challenges in ranking","created":"2025-12-24","cited_by_count":0,"area":null},{"id":"2606.01546","title":"Flexible Online Representation Learning Based on Similarity Matching","created":"2026-06-01","cited_by_count":0,"area":null}],"next_cursor":null}