Exact alignment recovery for correlated ErdH{o}s-R\'enyi graphs
read the original abstract
We consider the problem of perfectly recovering the vertex correspondence between two correlated Erd\H{o}s-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.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Attributed Network Alignment: Statistical Limits and Efficient Algorithm
The paper characterizes exact and partial recovery thresholds in the featured correlated Gaussian Wigner model and proposes the QPAlign quadratic programming algorithm with theoretical guarantees.
-
The feasibility of multi-graph alignment: a Bayesian approach
Establishes an all-or-nothing threshold for exact multi-graph alignment in the Gaussian model and a partial-alignment threshold in the sparse Erdős-Rényi model using a general Bayesian estimation framework over metric spaces.
-
Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model
GRAMPA recovers exact vertex correspondence in the Gaussian Wigner model with high probability for σ = O(1/log n) via a regularized quadratic relaxation using all eigenvector pairs.
-
The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
Umeyama algorithm achieves exact recovery of latent permutation π* in correlated Gaussian geometric models for σ = o(d^{-3}n^{-2/d}) and almost exact for σ = o(d^{-3}n^{-1/d}) when d = O(log n).
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.