{"total":16,"rows":[{"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":"2203.15736","title":"Exact Community Recovery in Correlated Stochastic Block Models","created":"2022-03-29","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":"2502.09832","title":"Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity","created":"2025-02-14","cited_by_count":3,"area":null},{"id":"2404.12418","title":"The graph alignment problem: fundamental limits and efficient algorithms","created":"2024-04-18","cited_by_count":2,"area":null},{"id":"2503.05323","title":"Graph Alignment via Birkhoff Relaxation","created":"2025-03-07","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":"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":"2402.07340","title":"Perfect Recovery for Random Geometric Graph Matching with Shallow Graph Neural Networks","created":"2024-02-12","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":"2512.00610","title":"Statistical-computational gap in multiple Gaussian graph alignment","created":"2025-11-29","cited_by_count":0,"area":null}],"next_cursor":null}