{"total":25,"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":"2102.02685","title":"Impossibility of Partial Recovery in the Graph Alignment Problem","created":"2021-02-04","cited_by_count":21,"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":"2107.07623","title":"Correlation detection in trees for planted graph alignment","created":"2021-07-15","cited_by_count":14,"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":"2209.13723","title":"Statistical limits of correlation detection in trees","created":"2022-09-27","cited_by_count":12,"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":"2310.10441","title":"Efficiently matching random inhomogeneous graphs via degree profiles","created":"2023-10-16","cited_by_count":5,"area":null},{"id":"2502.17142","title":"The feasibility of multi-graph alignment: a Bayesian approach","created":"2025-02-24","cited_by_count":3,"area":null},{"id":"2106.07106","title":"Alignment and Comparison of Directed Networks via Transition Couplings of Random Walks","created":"2021-06-13","cited_by_count":2,"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":"2505.13087","title":"Graph Alignment for Benchmarking Graph Neural Networks and Learning Positional Encodings","created":"2025-05-19","cited_by_count":2,"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":"2406.05428","title":"Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs","created":"2024-06-08","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":"2603.23305","title":"Sharp Statistical Thresholds for Attributed Gaussian Graph Matching","created":"2026-03-24","cited_by_count":0,"area":null}],"next_cursor":null}