{"total":20,"rows":[{"id":"2110.05000","title":"Exact Matching of Random Graphs with Constant Correlation","created":"2021-10-11","cited_by_count":23,"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":"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":"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":"2102.12975","title":"The Power of $D$-hops in Matching Power-Law Graphs","created":"2021-02-23","cited_by_count":7,"area":null},{"id":"2303.18051","title":"Synergistic Graph Fusion via Encoder Embedding","created":"2023-03-31","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":"2205.13679","title":"SeedGNN: Graph Neural Networks for Supervised Seeded Graph Matching","created":"2022-05-26","cited_by_count":3,"area":null},{"id":"2307.02459","title":"Gaussian Database Alignment and Gaussian Planted Matching","created":"2023-07-05","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":"2209.15608","title":"Shuffled linear regression through graduated convex relaxation","created":"2022-09-30","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":"2312.11054","title":"Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding","created":"2023-12-18","cited_by_count":1,"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":"2512.11761","title":"Covariate-assisted graph matching","created":"2025-12-12","cited_by_count":0,"area":null}],"next_cursor":null}