Graph matching beyond perfectly-overlapping Erdős–Rényi random graphs

06/05/2020

∙

by   Yaofang Hu, et al.

∙

0

∙

share

Graph matching is a fruitful area in terms of both algorithms and theories. In this paper, we exploit the degree information, which was previously used only in noiseless graphs and perfectly-overlapping Erdős–Rényi random graphs matching. We are concerned with graph matching of partially-overlapping graphs and stochastic block models, which are more useful in tackling real-life problems. We propose the edge exploited degree profile graph matching method and two refined varations. We conduct a thorough analysis of our proposed methods' performances in a range of challenging scenarios, including a zebrafish neuron activity data set and a coauthorship data set. Our methods are proved to be numerically superior than the state-of-the-art methods.