A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

arXiv:2306.00266v2 Announce Type: replace-cross
Abstract: We propose an efficient algorithm for matching two correlated Erd\H{o}s--R\'enyi graphs with $n$ vertices whose edges are correlated through a latent vertex correspondence. When the edge density $q= n^{- \alpha+o(1)}$ for a constant $\alpha \in [0,1)$, we show that our algorithm has polynomial running time and succeeds to recover the latent matching as long as the edge correlation is non-vanishing. This is closely related to our previous work on a polynomial-time algorithm that matches two …

abstract algorithm alpha arxiv correlation cs.ds edge graph graphs iterative math.pr math.st polynomial random running show stat.ml stat.th the edge through type vertex