4 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DS2023★ 4 cited
A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
Jian Ding, Zhangsong Li
We propose an efficient algorithm for matching two correlated Erdős--Rényi graphs with vertices whose edges are correlated through a latent vertex correspondence. When the edge…
cs.DS2022★ 2 cited
A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
Jian Ding, Zhangsong Li
Motivated by the problem of matching vertices in two correlated Erdős-Rényi graphs, we study the problem of matching two correlated Gaussian Wigner matrices. We propose an iterativ…