3 citations · 7 across the 7 of their papers we have counts for
1 paper · 1 filter
Jian Ding, Hang Du, Zhangsong Li
Given two Erdős-Rényi graphs with n vertices whose edges are correlated through a latent vertex correspondence, we study complexity lower bounds for the associated correlation de…