Exact alignment recovery for correlated ErdHos-R'enyi graphs
Not on the map. Why?
Abstract (arXiv)
We consider the problem of perfectly recovering the vertex correspondence between two correlated ErdHos-R'enyi (ER) graphs on the same vertex set. The correspondence between the vertices can be obscured by randomly permuting the vertex labels of one of the graphs. We determine the information-theoretic threshold for exact recovery, i.e. the conditions under which the entire vertex correspondence can be correctly recovered given unbounded computational resources.
Key facts. Cited by 38 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Nov 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 6; 2022: 9; 2023: 6; 2024: 6; 2025: 6; 2026: 5.
38 papers.
Sort:
- 2021Settling the Sharp Reconstruction Thresholds of Random Graph Matchingcited by 45
- 2022Random graph matching at Otter's threshold via counting chandelierscited by 25
- 2021Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communitiescited by 22
- 2021Testing network correlation efficiently via counting treescited by 22
- 2022Random Graph Matching in Geometric Models: the Case of Complete Graphscited by 22
- 2021Impossibility of Partial Recovery in the Graph Alignment Problemcited by 21
- 2022Matching recovery threshold for correlated random graphscited by 16
- 2021Correlation detection in trees for planted graph alignmentcited by 14
- 2022Detection threshold for correlated ErdHos-R'enyi graphs via densest subgraphscited by 13
- 2022Statistical limits of correlation detection in treescited by 12
- 2023A polynomial-time iterative algorithm for random graph matching with non-vanishing correlationcited by 9
- 2022Exact Community Recovery in Correlated Stochastic Block Modelscited by 8
26 more
- 2022A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlationcited by 8
- 2023Matching Correlated Inhomogeneous Random Graphs using the k-core Estimatorcited by 6
- 2024The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regimecited by 6
- 2023Efficiently matching random inhomogeneous graphs via degree profilescited by 5
- 2024Efficient Graph Matching for Correlated Stochastic Block Modelscited by 5
- 2022Seeded graph matching for the correlated Gaussian Wigner model via the projected power methodcited by 4
- 2023Gaussian Database Alignment and Gaussian Planted Matchingcited by 3
- 2023Graph Matching via convex relaxation to the simplexcited by 3
- 2025Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguitycited by 3
- 2025The feasibility of multi-graph alignment: a Bayesian approachcited by 3
- 2021Alignment and Comparison of Directed Networks via Transition Couplings of Random Walkscited by 2
- 2022Clustered Graph Matching for Label Recovery and Graph Classificationcited by 2
- 2024The graph alignment problem: fundamental limits and efficient algorithmscited by 2
- 2025Graph Alignment for Benchmarking Graph Neural Networks and Learning Positional Encodingscited by 2
- 2023Gotta match 'em all: Solution diversification in graph matching matched filterscited by 1
- 2025Exact Matching in Correlated Networks with Node Attributes for Improved Community Recoverycited by 1
- 2026Attributed Network Alignment: Statistical Limits and Efficient Algorithmcited by 1
- 2024Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphscited by 0
- 2024Testing Dependency of Weighted Random Graphscited by 0
- 2024Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithmcited by 0
- 2025Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)cited by 0
- 2025Covariate-assisted graph matchingcited by 0
- 2026Matching and mixing: Matchability of graphs under Markovian errorcited by 0
- 2026Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Boundscited by 0
- 2026Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Testscited by 0
- 2026Auditing Bayesian Graph Alignment: Diagnostic Comparisons and Reference Failurecited by 0
- 2026Auditing Bayesian Graph Alignment: Diagnostic Comparisons and Reference Failure19 Sep 2026
- 2026Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests10 Jul 2026
- 2026Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds11 Jun 2026
- 2026Attributed Network Alignment: Statistical Limits and Efficient Algorithm6 Apr 2026
- 2026Matching and mixing: Matchability of graphs under Markovian error27 Jan 2026
- 2025Covariate-assisted graph matching12 Dec 2025
- 2025Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)3 Jun 2025
- 2025Graph Alignment for Benchmarking Graph Neural Networks and Learning Positional Encodings19 May 2025
- 2025The feasibility of multi-graph alignment: a Bayesian approach24 Feb 2025
- 2025Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity14 Feb 2025
- 2025Exact Matching in Correlated Networks with Node Attributes for Improved Community Recovery6 Jan 2025
- 2024Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm21 Dec 2024
26 more
- 2024Efficient Graph Matching for Correlated Stochastic Block Models3 Dec 2024
- 2024Testing Dependency of Weighted Random Graphs23 Sep 2024
- 2024Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs8 Jun 2024
- 2024The graph alignment problem: fundamental limits and efficient algorithms18 Apr 2024
- 2024The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime23 Feb 2024
- 2023Graph Matching via convex relaxation to the simplex31 Oct 2023
- 2023Efficiently matching random inhomogeneous graphs via degree profiles16 Oct 2023
- 2023Gotta match 'em all: Solution diversification in graph matching matched filters25 Aug 2023
- 2023Gaussian Database Alignment and Gaussian Planted Matching5 Jul 2023
- 2023A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation1 Jun 2023
- 2023Matching Correlated Inhomogeneous Random Graphs using the k-core Estimator10 Feb 2023
- 2022A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation28 Dec 2022
- 2022Statistical limits of correlation detection in trees27 Sep 2022
- 2022Random graph matching at Otter's threshold via counting chandeliers25 Sep 2022
- 2022Matching recovery threshold for correlated random graphs29 May 2022
- 2022Clustered Graph Matching for Label Recovery and Graph Classification6 May 2022
- 2022Seeded graph matching for the correlated Gaussian Wigner model via the projected power method8 Apr 2022
- 2022Exact Community Recovery in Correlated Stochastic Block Models29 Mar 2022
- 2022Detection threshold for correlated ErdHos-R'enyi graphs via densest subgraphs28 Mar 2022
- 2022Random Graph Matching in Geometric Models: the Case of Complete Graphs22 Feb 2022
- 2021Testing network correlation efficiently via counting trees22 Oct 2021
- 2021Correlation detection in trees for planted graph alignment15 Jul 2021
- 2021Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities14 Jul 2021
- 2021Alignment and Comparison of Directed Networks via Transition Couplings of Random Walks13 Jun 2021
- 2021Impossibility of Partial Recovery in the Graph Alignment Problem4 Feb 2021
- 2021Settling the Sharp Reconstruction Thresholds of Random Graph Matching29 Jan 2021
- 2021Settling the Sharp Reconstruction Thresholds of Random Graph Matchingcited by 45
- 2022Random graph matching at Otter's threshold via counting chandelierscited by 25
- 2021Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communitiescited by 22
- 2021Testing network correlation efficiently via counting treescited by 22
- 2022Random Graph Matching in Geometric Models: the Case of Complete Graphscited by 22
- 2021Impossibility of Partial Recovery in the Graph Alignment Problemcited by 21
- 2022Matching recovery threshold for correlated random graphscited by 16
- 2021Correlation detection in trees for planted graph alignmentcited by 14
- 2022Detection threshold for correlated ErdHos-R'enyi graphs via densest subgraphscited by 13
- 2022Statistical limits of correlation detection in treescited by 12
- 2023A polynomial-time iterative algorithm for random graph matching with non-vanishing correlationcited by 9
- 2022Exact Community Recovery in Correlated Stochastic Block Modelscited by 8
12 most cited of 38 All 38 (JSON)
- 2026Auditing Bayesian Graph Alignment: Diagnostic Comparisons and Reference Failure19 Sep 2026
- 2026Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests10 Jul 2026
- 2026Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds11 Jun 2026
- 2026Attributed Network Alignment: Statistical Limits and Efficient Algorithm6 Apr 2026
- 2026Matching and mixing: Matchability of graphs under Markovian error27 Jan 2026
- 2025Covariate-assisted graph matching12 Dec 2025
- 2025Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)3 Jun 2025
- 2025Graph Alignment for Benchmarking Graph Neural Networks and Learning Positional Encodings19 May 2025
- 2025The feasibility of multi-graph alignment: a Bayesian approach24 Feb 2025
- 2025Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity14 Feb 2025
- 2025Exact Matching in Correlated Networks with Node Attributes for Improved Community Recovery6 Jan 2025
- 2024Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm21 Dec 2024
12 newest of 38 All 38 (JSON)