Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model

07/20/2019
by   Zhou Fan, et al.
0

Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally intractable quadratic assignment problem. In this paper we propose a new spectral method, GRAph Matching by Pairwise eigen-Alignments (GRAMPA). Departing from prior spectral approaches that only compare top eigenvectors, or eigenvectors of the same order, GRAMPA first constructs a similarity matrix as a weighted sum of outer products between all pairs of eigenvectors of the two graphs, with weights given by a Cauchy kernel applied to the separation of the corresponding eigenvalues, then outputs a matching by a simple rounding procedure. The similarity matrix can also be interpreted as the solution to a regularized quadratic programming relaxation of the quadratic assignment problem. For the Gaussian Wigner model in which two complete graphs on n vertices have Gaussian edge weights with correlation coefficient 1-σ^2, we show that GRAMPA exactly recovers the correct vertex correspondence with high probability when σ = O(1/ n). This matches the state of the art of polynomial-time algorithms, and significantly improves over existing spectral methods which require σ to be polynomially small in n. The superiority of GRAMPA is also demonstrated on a variety of synthetic and real datasets, in terms of both statistical accuracy and computational efficiency. Universality results, including similar guarantees for dense and sparse Erdős-Rényi graphs, are deferred to the companion paper.

READ FULL TEXT
research
07/20/2019

Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality

We analyze a new spectral graph matching algorithm, GRAph Matching by Pa...
research
06/17/2008

Learning Graph Matching

As a fundamental problem in pattern recognition, graph matching has appl...
research
03/05/2021

Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs

This article unveils a new relation between the Nishimori temperature pa...
research
09/25/2022

Random graph matching at Otter's threshold via counting chandeliers

We propose an efficient algorithm for graph matching based on similarity...
research
07/24/2018

Tractable Graph Matching via Soft Seeding

The graph matching problem aims to discover a latent correspondence betw...
research
01/29/2014

Graph matching: relax or not?

We consider the problem of exact and inexact matching of weighted undire...
research
06/07/2019

Vertex Classification on Weighted Networks

This paper proposes a discrimination technique for vertices in a weighte...

Please sign up or login with your details

Forgot password? Click here to reset