Efficient random graph matching via degree profiles

11/19/2018
by   Jian Ding, et al.
0

Random graph matching refers to recovering the underlying vertex correspondence between two random graphs with correlated edges; a prominent example is when the two random graphs are given by Erdős-Rényi graphs G(n,d/n). This can be viewed as an average-case and noisy version of the graph isomorphism problem. Under this model, the maximum likelihood estimator is equivalent to solving the intractable quadratic assignment problem. This work develops an Õ(n d^2+n^2)-time algorithm which perfectly recovers the true vertex correspondence with high probability, provided that the average degree is at least d = Ω(^2 n) and the two graphs differ by at most δ = O( ^-2(n) ) fraction of edges. For dense graphs and sparse graphs, this can be improved to δ = O( ^-2/3(n) ) and δ = O( ^-2(d) ) respectively, both in polynomial time. The methodology is based on appropriately chosen distance statistics of the degree profiles (empirical distribution of the degrees of neighbors). Before this work, the best known result achieves δ=O(1) and n^o(1)≤ d ≤ n^c for some constant c with an n^O( n)-time algorithm barak2018nearly and δ=Õ((d/n)^4) and d = Ω̃(n^4/5) with a polynomial-time algorithm dai2018performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/07/2018

(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs

We give a quasipolynomial time algorithm for the graph matching problem ...
research
10/11/2021

Exact Matching of Random Graphs with Constant Correlation

This paper deals with the problem of graph matching or network alignment...
research
02/04/2021

Impossibility of Partial Recovery in the Graph Alignment Problem

Random graph alignment refers to recovering the underlying vertex corres...
research
07/15/2019

Seedless Graph Matching via Tail of Degree Distribution for Correlated Erdos-Renyi Graphs

The graph matching problem refers to recovering the node-to-node corresp...
research
07/24/2018

Tractable Graph Matching via Soft Seeding

The graph matching problem aims to discover a latent correspondence betw...
research
02/23/2021

The Power of D-hops in Matching Power-Law Graphs

This paper studies seeded graph matching for power-law graphs. Assume th...
research
07/12/2021

Strong recovery of geometric planted matchings

We study the problem of efficiently recovering the matching between an u...

Please sign up or login with your details

Forgot password? Click here to reset