Seeded graph matching for the correlated Gaussian Wigner model via the projected power method

arXiv:2204.04099v3 Announce Type: replace-cross
Abstract: In the \emph{graph matching} problem we observe two graphs $G,H$ and the goal is to find an assignment (or matching) between their vertices such that some measure of edge agreement is maximized. We assume in this work that the observed pair $G,H$ has been drawn from the Correlated Gaussian Wigner (CGW) model -- a popular model for correlated weighted graphs -- where the entries of the adjacency matrices of $G$ and $H$ are independent Gaussians …

abstract agreement arxiv edge graph graphs math.st observe power stat.ml stat.th type via work