Tractable Graph Matching via Soft Seeding

07/24/2018
by   Fei Fang, et al.
0

The graph matching problem aims to discover a latent correspondence between the vertex sets of two observed graphs. This problem has proven to be quite challenging, with few satisfying methods that are computationally tractable and widely applicable. The FAQ algorithm has proven to have good performance on benchmark problems and works with a indefinite relaxation of the problem. Due to the indefinite relaxation, FAQ is not guaranteed to find the global maximum. However, if prior information is known about the true correspondence, this can be leveraged to initialize the algorithm near the truth. We show that given certain properties of this initial matrix, with high probability the FAQ algorithm will converge in two steps to the truth under a flexible model for pairs of random graphs. Importantly, this result implies that there will be no local optima near the global optima, providing a method to assess performance.

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
03/06/2018

Matched Filters for Noisy Induced Subgraph Detection

We consider the problem of finding the vertex correspondence between two...
research
11/19/2018

Efficient random graph matching via degree profiles

Random graph matching refers to recovering the underlying vertex corresp...
research
07/20/2019

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

Graph matching aims at finding the vertex correspondence between two unl...
research
05/08/2016

Information Recovery in Shuffled Graphs via Graph Matching

While many multiple graph inference methodologies operate under the impl...
research
02/06/2014

Near-Optimal Joint Object Matching via Convex Relaxation

Joint matching over a collection of objects aims at aggregating informat...
research
01/29/2014

Graph matching: relax or not?

We consider the problem of exact and inexact matching of weighted undire...

Please sign up or login with your details

Forgot password? Click here to reset