Seeded Graph Matching via Large Neighborhood Statistics

07/26/2018
by   Elchanan Mossel, et al.
0

We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erdős-Rényi random graphs, with an initial seed set of correctly matched vertex pairs revealed as side information. For seeded problems, our result provides a significant improvement over previously known results. 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 exact recovery in polynomial-time can be as low as n^3ϵ in the sparse graph regime (with the average degree smaller than n^ϵ) and Ω( n) in the dense graph regime. Our results also shed light on the unseeded problem. In particular, we give sub-exponential time algorithms for sparse models and an n^O( n) algorithm for dense models for some parameters, including some that are not covered by recent results of Barak et al.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/07/2018

(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs

We give a quasipolynomial time algorithm for the graph matching problem ...
03/06/2018

Matched Filters for Noisy Induced Subgraph Detection

We consider the problem of finding the vertex correspondence between two...
02/23/2021

The Power of D-hops in Matching Power-Law Graphs

This paper studies seeded graph matching for power-law graphs. Assume th...
08/14/2021

On Support Recovery with Sparse CCA: Information Theoretic and Computational Limits

In this paper we consider asymptotically exact support recovery in the c...
04/05/2019

On the computational tractability of statistical estimation on amenable graphs

We consider the problem of estimating a vector of discrete variables (θ_...
08/08/2020

A simpler strong refutation of random k-XOR

Strong refutation of random CSPs is a fundamental question in theoretica...
04/08/2022

Seeded graph matching for the correlated Wigner model via the projected power method

In the graph matching problem we observe two graphs G,H and the goal is ...