Back to Search
Start Over
Seeded graph matching via large neighborhood statistics.
- Source :
- Random Structures & Algorithms; Oct2020, Vol. 57 Issue 3, p570-611, 42p
- Publication Year :
- 2020
-
Abstract
- 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 limit of graph sparsity in time polynomial in the number of vertices n. Moreover, we show the number of seeds needed for perfect recovery in polynomial‐time can be as low as nϵ in the sparse graph regime (with the average degree smaller than nϵ) and Ω(logn) in the dense graph regime, for a small positive constant ϵ. Unlike previous work on graph matching, which used small neighborhoods or small subgraphs with a logarithmic number of vertices in order to match vertices, our algorithms match vertices if their large neighborhoods have a significant overlap in the number of seeds. [ABSTRACT FROM AUTHOR]
- Subjects :
- DENSE graphs
POLYNOMIAL time algorithms
NEIGHBORHOODS
STATISTICS
Subjects
Details
- Language :
- English
- ISSN :
- 10429832
- Volume :
- 57
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Random Structures & Algorithms
- Publication Type :
- Academic Journal
- Accession number :
- 145201897
- Full Text :
- https://doi.org/10.1002/rsa.20934