Seeded graph matching via large neighborhood statistics

We study a noisy graph isomorphism problem, where the goal is to perfectly recover the vertex correspondence between two edge‐correlated graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. We show that it is possible to achieve the information‐theoretic l...

Full description

Bibliographic Details

Published in:	Random structures & algorithms Vol. 57; no. 3; pp. 570 - 611
Main Authors:	Mossel, Elchanan, Xu, Jiaming
Format:	Journal Article
Language:	English
Published:	New York John Wiley & Sons, Inc 01.10.2020 Wiley Subscription Services, Inc
Subjects:	Algorithms Apexes branching process graph isomorphism Graph matching Graph theory Isomorphism Polynomials Seeds subgraph count
ISSN:	1042-9832, 1098-2418
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!