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

07/15/2019
by   Mahdi Bozorg, et al.
0

The graph matching problem refers to recovering the node-to-node correspondence between two correlated graphs. A previous work theoretically showed that recovering is feasible in sparse Erdos-Renyi graphs if and only if the probability of having an edge between a pair of nodes in one of the graphs and also between the corresponding nodes in the other graph is in the order of Ω((n)/n), where n is the number of nodes. In this paper, we propose a graph matching algorithm which obtains correct matching with high probability in Erdos-Renyi graphs for the region of Θ((n)/n) without using a seed set of pre-matched node pairs as an input. The algorithm assigns structurally innovative features to high-degree nodes based on the tail of empirical degree distribution of their neighbor nodes. Then, it matches the high-degree nodes according to these features, and finally obtains a matching for the remaining nodes. We evaluate the performance of proposed algorithm in the regions of Θ((n)/n) and Θ(^2(n)/n). Experiments show that it outperforms previous works in both regions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/25/2018

On the Performance of a Canonical Labeling for Matching Correlated Erdős-Rényi Graphs

Graph matching in two correlated random graphs refers to the task of ide...
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
11/19/2018

Efficient random graph matching via degree profiles

Random graph matching refers to recovering the underlying vertex corresp...
research
07/03/2012

A Fast Projected Fixed-Point Algorithm for Large Graph Matching

We propose a fast approximate algorithm for large graph matching. A new ...
research
10/04/2019

Targeted sampling from massive Blockmodel graphs with personalized PageRank

This paper provides statistical theory and intuition for Personalized Pa...
research
10/26/2018

Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information

Driven by many real applications, we study the problem of seeded graph m...
research
09/05/2018

Ranking RDF Instances in Degree-decoupled RDF Graphs

In the last decade, RDF emerged as a new kind of standardized data model...

Please sign up or login with your details

Forgot password? Click here to reset