{"total":29,"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":"2209.12313","title":"Random graph matching at Otter's threshold via counting chandeliers","created":"2022-09-25","cited_by_count":25,"area":null},{"id":"2110.05000","title":"Exact Matching of Random Graphs with Constant Correlation","created":"2021-10-11","cited_by_count":23,"area":null},{"id":"2107.06767","title":"Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities","created":"2021-07-14","cited_by_count":22,"area":null},{"id":"2110.11816","title":"Testing network correlation efficiently via counting trees","created":"2021-10-22","cited_by_count":22,"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":"2101.11783","title":"Random Graph Matching with Improved Noise Robustness","created":"2021-01-28","cited_by_count":16,"area":null},{"id":"2205.14650","title":"Matching recovery threshold for correlated random graphs","created":"2022-05-29","cited_by_count":16,"area":null},{"id":"2203.14573","title":"Detection threshold for correlated Erd\\H{o}s-R\\'enyi graphs via densest subgraphs","created":"2022-03-28","cited_by_count":13,"area":null},{"id":"2306.00266","title":"A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation","created":"2023-06-01","cited_by_count":9,"area":null},{"id":"2203.15736","title":"Exact Community Recovery in Correlated Stochastic Block Models","created":"2022-03-29","cited_by_count":8,"area":null},{"id":"2212.13677","title":"A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation","created":"2022-12-28","cited_by_count":8,"area":null},{"id":"2302.05407","title":"Matching Correlated Inhomogeneous Random Graphs using the $k$-core Estimator","created":"2023-02-10","cited_by_count":6,"area":null},{"id":"2402.15095","title":"The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime","created":"2024-02-23","cited_by_count":6,"area":null},{"id":"2409.00966","title":"A computational transition for detecting correlated stochastic block models by low-degree polynomials","created":"2024-09-02","cited_by_count":6,"area":null},{"id":"2310.10441","title":"Efficiently matching random inhomogeneous graphs via degree profiles","created":"2023-10-16","cited_by_count":5,"area":null},{"id":"2205.03486","title":"Clustered Graph Matching for Label Recovery and Graph Classification","created":"2022-05-06","cited_by_count":2,"area":null},{"id":"2209.15608","title":"Shuffled linear regression through graduated convex relaxation","created":"2022-09-30","cited_by_count":2,"area":null},{"id":"2305.19666","title":"Efficient Algorithms for Exact Graph Matching on Correlated Stochastic Block Models with Constant Correlation","created":"2023-05-31","cited_by_count":1,"area":null},{"id":"2308.13451","title":"Gotta match 'em all: Solution diversification in graph matching matched filters","created":"2023-08-25","cited_by_count":1,"area":null},{"id":"2406.11249","title":"Relational Learning in Pre-Trained Models: A Theory from Hypergraph Recovery Perspective","created":"2024-06-17","cited_by_count":1,"area":null},{"id":"2501.02851","title":"Exact Matching in Correlated Networks with Node Attributes for Improved Community Recovery","created":"2025-01-06","cited_by_count":1,"area":null},{"id":"2406.05428","title":"Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs","created":"2024-06-08","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":"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":"2506.02825","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","created":"2025-06-03","cited_by_count":0,"area":null},{"id":"2510.03086","title":"Chaining 2-FWL GNNs for Combinatorial Graph Alignment","created":"2025-10-03","cited_by_count":0,"area":null},{"id":"2512.11761","title":"Covariate-assisted graph matching","created":"2025-12-12","cited_by_count":0,"area":null},{"id":"2601.20020","title":"Matching and mixing: Matchability of graphs under Markovian error","created":"2026-01-27","cited_by_count":0,"area":null}],"next_cursor":null}