Exact matching of random graphs with constant correlation

• Published in: Probability theory and related fields Vol. 186; no. 1-2; pp. 327 - 389
• Main Authors: Mao, Cheng, Rudelson, Mark, Tikhomirov, Konstantin
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2023; Springer Nature B.V
• Subjects: Algorithms; Correlation; Economics; Finance; Graph matching; Graph theory; Graphs; Insurance; Isomorphism; Management; Mathematical and Computational Biology; Mathematical and Computational Physics; Mathematics; Mathematics and Statistics; Operations Research/Decision Theory; Probability; Probability Theory and Stochastic Processes; Quantitative Finance; Statistics for Business; Theoretical; Trees (mathematics); 05C85; 05C80
• ISSN: 0178-8051; 1432-2064
• DOI: 10.1007/s00440-022-01184-3

This paper deals with the problem of graph matching or network alignment for Erdős–Rényi graphs, which can be viewed as a noisy average-case version of the graph isomorphism problem. Let G and G ′ be G ( n ,  p ) Erdős–Rényi graphs marginally, identified with their adjacency matrices. Assume that G and G ′ are correlated such that E [ G ij G ij ′ ] = p ( 1 - α ) . For a permutation π representing a latent matching between the vertices of G and G ′ , denote by G π the graph obtained from permuting the vertices of G by π . Observing G π and G ′ , we aim to recover the matching π . In this work, we show that for every ε ∈ ( 0 , 1 ] , there is n 0 > 0 depending on ε and absolute constants α 0 , R > 0 with the following property. Let n ≥ n 0 , ( 1 + ε ) log n ≤ n p ≤ n 1 R log log n , and 0 < α < min ( α 0 , ε / 4 ) . There is a polynomial-time algorithm F such that P { F ( G π , G ′ ) = π } = 1 - o ( 1 ) . This is the first polynomial-time algorithm that recovers the exact matching between vertices of correlated Erdős–Rényi graphs with constant correlation with high probability. The algorithm is based on comparison of partition trees associated with the graph vertices.