Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs
arXiv:2006.03284
Abstract
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.
References in corpus (7)
- De-anonymizing Social Networks
- Simultaneous whole-animal 3D-imaging of neuronal activity using light field microscopy
- Fast community detection by SCORE
- Coauthorship and Citation Networks for Statisticians
- Seeded graph matching for correlated Erdős-Rényi graphs
- Efficient random graph matching via degree profiles
- Matching Community Structure Across Online Social Networks