arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2102.06267cs.ITcs.SImath.IT
收藏

基于广义种子边信息的图匹配

On Graph Matching Using Generalized Seed Side-Information

Mahshad Shariatnasab, Farhad Shirani, Siddharth Garg, Elza Erkip

摘要:

本文研究了具有广义种子边信息的随机生成图的匹配问题。图匹配问题自然地出现在各种应用中,诸如社交网络去匿名化、图像处理、DNA测序和自然语言处理。考虑了一对随机生成的带两两相关边的标记Erdos-Renyi图。假设匹配策略可以访问第一个图中的顶点的标签,以及第二个图的顶点的可能标签的短列表的集合-称为模糊集。目标是利用图的边之间的相关性以及以模糊集的形式提供的边信息来恢复第二图中的顶点的标签。这种情况可以被视为种子图匹配问题的一般化,其中模糊集采取特定形式,使得在匹配之前已知第二图中的顶点子集的确切标签。提出了一种匹配策略,该策略通过评估图的邻接矩阵的联合典型性来操作。边统计以及模糊集统计的充分条件,推导出所提出的匹配策略成功地恢复第二个图中的顶点的标签。此外,Fano类型参数用于导出成功匹配的一般必要条件。

英文摘要:

In this paper, matching pairs of stocahstically generated graphs in the presence of generalized seed side-information is considered. The graph matching problem emerges naturally in various applications such as social network de-anonymization, image processing, DNA sequencing, and natural language processing. A pair of randomly generated labeled Erdos-Renyi graphs with pairwise correlated edges are considered. It is assumed that the matching strategy has access to the labeling of the vertices in the first graph, as well as a collection of shortlists -- called ambiguity sets -- of possible labels for the vertices of the second graph. The objective is to leverage the correlation among the edges of the graphs along with the side-information provided in the form of ambiguity sets to recover the labels of the vertices in the second graph. This scenario can be viewed as a generalization of the seeded graph matching problem, where the ambiguity sets take a specific form such that the exact labels for a subset of vertices in the second graph are known prior to matching. A matching strategy is proposed which operates by evaluating the joint typicality of the adjacency matrices of the graphs. Sufficient conditions on the edge statistics as well as ambiguity set statistics are derived under which the proposed matching strategy successfully recovers the labels of the vertices in the second graph. Additionally, Fano-type arguments are used to derive general necessary conditions for successful matching.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑