Matching Graphs with Community Structure: A Concentration of Measure Approach

10/31/2018
by   F. Shirani, et al.
0

In this paper, matching pairs of random graphs under the community structure model is considered. The problem emerges naturally in various applications such as privacy, image processing and DNA sequencing. A pair of randomly generated labeled graphs with pairwise correlated edges are considered. It is assumed that the graph edges are generated based on the community structure model. Given the labeling of the edges of the first graph, the objective is to recover the labels in the second graph. The problem is considered under two scenarios: i) with side-information where the community membership of the nodes in both graphs are known, and ii) without side-information where the community memberships are not known. A matching scheme is proposed which operates based on typicality of the adjacency matrices of the graphs. Achievability results are derived which provide theoretical guarantees for successful matching under specific assumptions on graph parameters. It is observed that for the proposed matching scheme, the conditions for successful matching do not change in the presence of side-information. Furthermore, a converse result is derived which characterizes a set of graph parameters for which matching is not possible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2020

A Concentration of Measure Approach to Correlated Graph Matching

The graph matching problem emerges naturally in various applications suc...
research
02/11/2021

On Graph Matching Using Generalized Seed Side-Information

In this paper, matching pairs of stocahstically generated graphs in the ...
research
02/03/2018

Typicality Matching for Pairs of Correlated Graphs

In this paper, the problem of matching pairs of correlated random graphs...
research
08/08/2018

On the Solvability of Viewing Graphs

A set of fundamental matrices relating pairs of cameras in some configur...
research
09/19/2021

Property-based Entity Type Graph Matching

We are interested in dealing with the heterogeneity of Knowledge bases (...
research
04/10/2018

Graph Matching with Anchor Nodes: A Learning Approach

In this paper, we consider the weighted graph matching problem with part...
research
11/15/2017

CTRL+Z: Recovering Anonymized Social Graphs

Social graphs derived from online social interactions contain a wealth o...

Please sign up or login with your details

Forgot password? Click here to reset