Cheng Mao

Spectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory

Graph matching, also known as network alignment, aims at recovering the latent vertex correspondence between two unlabeled, edge-correlated weighted graphs. To tackle this task, we propose a spectral method, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), which first constructs a similarity ma…