A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation

arXiv2212.13677MaRDI QIDQ6421871FDOQ6421871

Authors: Jian Ding, Zhangsong Li 

Publication date: 27 December 2022

Abstract: Motivated by the problem of matching vertices in two correlated ErdH{o}s-R'enyi graphs, we study the problem of matching two correlated Gaussian Wigner matrices. We propose an iterative matching algorithm, which succeeds in polynomial time as long as the correlation between the two Gaussian matrices does not vanish. Our result is the first polynomial time algorithm that solves a graph matching type of problem when the correlation is an arbitrarily small constant.

This page was built for publication: A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation

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