Exact alignment recovery for correlated Erdős-Rényi graphs

Abstract

We consider the problem of perfectly recovering the vertex correspondence between two correlated Erdős-Rényi (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.

12 pages. arXiv admin note: text overlap with arXiv:1602.01042

Cited by in corpus (13)

• Efficient random graph matching via degree profiles
• Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model
• Impossibility of Partial Recovery in the Graph Alignment Problem
• Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities
• Statistical limits of correlation detection in trees
• Testing correlation of unlabeled random graphs
• Graph Matching with Partially-Correct Seeds
• Correlation detection in trees for planted graph alignment
• The Phantom Alignment Strength Conjecture: Practical use of graph matching alignment strength to indicate a meaningful graph match
• SPECTRE: Seedless Network Alignment via Spectral Centralities
• Attributed Graph Alignment
• Typicality Matching for Pairs of Correlated Graphs
• Matching Graphs with Community Structure: A Concentration of Measure Approach