From tree matching to sparse graph alignment

02/04/2020
by   Luca Ganassali, et al.
0

In this paper we consider alignment of sparse graphs, for which we introduce the Neighborhood Tree Matching Algorithm (NTMA). For correlated Erdős-Rényi random graphs, we prove that the algorithm returns – in polynomial time – a positive fraction of correctly matched vertices, and a vanishing fraction of mismatches. This result holds with average degree of the graphs in O(1) and correlation parameter s bounded away from 1, conditions under which random graph alignment is particularly challenging. As a byproduct of the analysis we introduce a matching metric between trees and characterize it for several models of correlated random trees. These results may be of independent interest, yielding for instance efficient tests for determining whether two random trees are correlated or independent.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2021

Correlation detection in trees for partial graph alignment

Motivated by alignment of correlated sparse random graphs, we study a hy...
research
09/10/2018

Partial Recovery of Erdős-Rényi Graph Alignment via k-Core Alignment

We determine information theoretic conditions under which it is possible...
research
09/27/2022

Statistical limits of correlation detection in trees

In this paper we address the problem of testing whether two observed tre...
research
04/28/2020

Correlated randomly growing graphs

We introduce a new model of correlated randomly growing graphs and study...
research
11/30/2019

Spectral alignment of correlated Gaussian random matrices

In this paper we analyze a simple method (EIG1) for the problem of matri...
research
02/23/2020

On a complete and sufficient statistic for the correlated Bernoulli random graph model

Inference on vertex-aligned graphs is of wide theoretical and practical ...
research
06/01/2023

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

We propose an efficient algorithm for matching two correlated Erdős–Rény...

Please sign up or login with your details

Forgot password? Click here to reset