Random Graph Matching with Improved Noise Robustness

01/28/2021
by   Cheng Mao, et al.
0

Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields such as computer vision and biology. Recently, there has been a plethora of work studying efficient algorithms for graph matching under probabilistic models. In this work, we propose a new algorithm for graph matching and show that, for two Erdős-Rényi graphs with edge correlation 1-α, our algorithm recovers the underlying matching with high probability when α≤ 1 / (loglog n)^C, where n is the number of vertices in each graph and C denotes a positive universal constant. This improves the condition α≤ 1 / (log n)^C achieved in previous work.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/08/2020

Graph Matching with Partially-Correct Seeds

The graph matching problem aims to find the latent vertex correspondence...
09/03/2012

Seeded Graph Matching

Given two graphs, the graph matching problem is to align the two vertex ...
11/02/2016

Initialization and Coordinate Optimization for Multi-way Matching

We consider the problem of consistently matching multiple sets of elemen...
11/13/2020

Matching through Embedding in Dense Graphs

Finding optimal matchings in dense graphs is of general interest and of ...
01/25/2022

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment

Graph alignment aims at finding the vertex correspondence between two co...
07/14/2020

Graph Sparsification by Universal Greedy Algorithms

Graph sparsification is to approximate an arbitrary graph by a sparse gr...
08/10/2020

Connected Components in Undirected Set–Based Graphs. Applications in Object–Oriented Model Manipulation

This work introduces a novel algorithm for finding the connected compone...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.