Search Results for author:
Found 3 papers, 0 papers with code
The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
For the low-dimensional regime where $d=O(\log n)$, Wang, Wu, Xu, and Yolou [WWXY22+] established the information thresholds for exact and almost exact recovery in matching correlated Gaussian geometric models.
A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
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.
A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
Motivated by the problem of matching vertices in two correlated Erd\H{o}s-R\'enyi graphs, we study the problem of matching two correlated Gaussian Wigner matrices.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
