On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment

01/25/2022
by   Ziao Wang, et al.
0

Graph alignment aims at finding the vertex correspondence between two correlated graphs, a task that frequently occurs in graph mining applications such as social network analysis. Attributed graph alignment is a variant of graph alignment, in which publicly available side information or attributes are exploited to assist graph alignment. Existing studies on attributed graph alignment focus on either theoretical performance without computational constraints or empirical performance of efficient algorithms. This motivates us to investigate efficient algorithms with theoretical performance guarantee. In this paper, we propose two polynomial-time algorithms that exactly recover the vertex correspondence with high probability. The feasible region of the proposed algorithms is near optimal compared to the information-theoretic limits. When specialized to the seeded graph alignment problem, the proposed algorithms strictly improve the best known feasible region for exact alignment by polynomial-time algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/01/2021

Attributed Graph Alignment

Motivated by various data science applications including de-anonymizing ...
research
08/17/2023

Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation

Graph alignment refers to the task of finding the vertex correspondence ...
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
05/31/2023

Efficient Algorithms for Exact Graph Matching on Correlated Stochastic Block Models with Constant Correlation

We consider the problem of graph matching, or learning vertex correspond...
research
04/06/2021

Sparse Partial Least Squares for Coarse Noisy Graph Alignment

Graph signal processing (GSP) provides a powerful framework for analyzin...
research
05/17/2022

Fast and Provably Convergent Algorithms for Gromov-Wasserstein in Graph Learning

In this paper, we study the design and analysis of a class of efficient ...
research
11/13/2022

Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment

Preferential attachment lies at the heart of many network models aiming ...

Please sign up or login with your details

Forgot password? Click here to reset