1 paper · 1 filter
Nicolas Fraiman, Michael Nisenzon
We study graph matching between two correlated networks in the almost fully seeded regime, where all but a vanishing fraction of vertex correspondences are revealed. Concretely, we…