Partial Recovery in the Graph Alignment Problem

DOI10.1287/OPRE.2022.2355arXiv2007.00533OpenAlexW3040496082MaRDI QIDQ6202672FDOQ6202672

Authors: Georgina Hall, Laurent Massoulié 

Publication date: 26 February 2024

Published in: Operations Research (Search for Journal in Brave)

Abstract: In this paper, we consider the graph alignment problem, which is the problem of recovering, given two graphs, a one-to-one mapping between nodes that maximizes edge overlap. This problem can be viewed as a noisy version of the well-known graph isomorphism problem and appears in many applications, including social network deanonymization and cellular biology. Our focus here is on partial recovery, i.e., we look for a one-to-one mapping which is correct on a fraction of the nodes of the graph rather than on all of them, and we assume that the two input graphs to the problem are correlated ErdH{o}s-R'enyi graphs of parameters $(n,q,s)$. Our main contribution is then to give necessary and sufficient conditions on $(n,q,s)$ under which partial recovery is possible with high probability as the number of nodes $n$ goes to infinity. In particular, we show that it is possible to achieve partial recovery in the $nqs=Theta(1)$ regime under certain additional assumptions.

Full work available at URL: https://arxiv.org/abs/2007.00533

zbMATH Keywords

partial recoverygraph alignmentmachine learning and data sciencecorrelated Erdős-Rényi graphs

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cited In (2)

• Correlation detection in trees for planted graph alignment
• Statistical limits of correlation detection in trees

This page was built for publication: Partial Recovery in the Graph Alignment Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202672)