{"total":18,"rows":[{"id":"2301.04822","title":"Private estimation algorithms for stochastic block models and mixture models","created":"2023-01-11","cited_by_count":21,"area":null},{"id":"2207.11903","title":"Minimax Rates for Robust Community Detection","created":"2022-07-25","cited_by_count":12,"area":null},{"id":"2305.00979","title":"Spectral clustering in the Gaussian mixture block model","created":"2023-04-29","cited_by_count":7,"area":null},{"id":"2305.10227","title":"Reaching Kesten-Stigum Threshold in the Stochastic Block Model under Node Corruptions","created":"2023-05-17","cited_by_count":7,"area":null},{"id":"2211.07327","title":"Higher degree sum-of-squares relaxations robust against oblivious outliers","created":"2022-11-14","cited_by_count":6,"area":null},{"id":"2311.09017","title":"Semidefinite programs simulate approximate message passing robustly","created":"2023-11-15","cited_by_count":6,"area":null},{"id":"2203.07346","title":"Sparse random hypergraphs: Non-backtracking spectra and community detection","created":"2022-03-14","cited_by_count":5,"area":null},{"id":"2302.00037","title":"Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees","created":"2023-01-31","cited_by_count":5,"area":null},{"id":"2501.09189","title":"Testing Noise Assumptions of Learning Algorithms","created":"2025-01-15","cited_by_count":4,"area":null},{"id":"2411.02764","title":"Fast, robust approximate message passing","created":"2024-11-05","cited_by_count":3,"area":null},{"id":"2411.02835","title":"Community detection with the Bethe-Hessian","created":"2024-11-05","cited_by_count":3,"area":null},{"id":"2502.15024","title":"Low degree conjecture implies sharp computational thresholds in stochastic block model","created":"2025-02-20","cited_by_count":3,"area":null},{"id":"2406.04857","title":"A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering","created":"2024-06-07","cited_by_count":2,"area":null},{"id":"2406.04868","title":"Perturb-and-Project: Differentially Private Similarities and Marginals","created":"2024-06-07","cited_by_count":1,"area":null},{"id":"2404.00768","title":"Adversarially-Robust Inference on Trees via Belief Propagation","created":"2024-03-31","cited_by_count":0,"area":null},{"id":"2406.04860","title":"Multi-View Stochastic Block Models","created":"2024-06-07","cited_by_count":0,"area":null},{"id":"2412.16457","title":"Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm","created":"2024-12-21","cited_by_count":0,"area":null},{"id":"2607.04869","title":"Active Learning on Adversarially Corrupted Graphs","created":"2026-07-06","cited_by_count":0,"area":null}],"next_cursor":null}