{"total":18,"rows":[{"id":"2102.00082","title":"Settling the Sharp Reconstruction Thresholds of Random Graph Matching","created":"2021-01-29","cited_by_count":45,"area":null},{"id":"2202.10662","title":"Random Graph Matching in Geometric Models: the Case of Complete Graphs","created":"2022-02-22","cited_by_count":22,"area":null},{"id":"2105.04770","title":"Exact Recovery in the General Hypergraph Stochastic Block Model","created":"2021-05-11","cited_by_count":13,"area":null},{"id":"2109.06610","title":"Statistical limits of dictionary learning: random matrix theory and the spectral replica method","created":"2021-09-14","cited_by_count":10,"area":null},{"id":"2103.09383","title":"The planted matching problem: Sharp threshold and infinite-order phase transition","created":"2021-03-17","cited_by_count":9,"area":null},{"id":"2304.08135","title":"Detection of Dense Subhypergraphs by Low-Degree Polynomials","created":"2023-04-17","cited_by_count":7,"area":null},{"id":"2101.06388","title":"Informative core identification in complex networks","created":"2021-01-16","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":"2102.04439","title":"Community Detection: Exact Recovery in Weighted Graphs","created":"2021-02-08","cited_by_count":2,"area":null},{"id":"2105.02259","title":"Information Limits for Detecting a Subhypergraph","created":"2021-05-05","cited_by_count":2,"area":null},{"id":"2109.05408","title":"On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs","created":"2021-09-12","cited_by_count":2,"area":null},{"id":"2403.04234","title":"Fundamental limits of Non-Linear Low-Rank Matrix Estimation","created":"2024-03-07","cited_by_count":2,"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":"2203.11847","title":"Spectral Algorithms Optimally Recover Planted Sub-structures","created":"2022-03-22","cited_by_count":0,"area":null},{"id":"2409.14870","title":"Testing Dependency of Weighted Random Graphs","created":"2024-09-23","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}],"next_cursor":null}