基于谱嵌入和二次规划的图间顶点指定
Vertex nomination between graphs via spectral embedding and quadratic programming
摘要:
给定一个网络和一个其身份仅部分已知的感兴趣顶点的子集,顶点提名问题试图以这样的方式对剩余顶点进行排名,即感兴趣的顶点排名在列表的顶部。这个问题的一个重要的变种是顶点提名的多图设置。给定具有共同顶点和感兴趣顶点$x \in G_1$的两个图$G_1, G_2$,我们希望对$G_2$的顶点进行排名,使得与$x$最相似的顶点排名在列表的顶部。本文针对这一问题,提出了一种方法,首先利用邻接谱图嵌入将图嵌入到一个共同的欧氏空间中,然后通过求解惩罚线性分配问题来获得提名列表。由于谱嵌入的图是唯一的正交变换,我们提出了两种方法来消除这种潜在的不可识别性。一种方法是基于正交Procrustes和适用时,有足够的顶点与已知的对应关系的两个图。另一种方法使用自适应点集配准,并且当具有已知对应关系的顶点很少或没有时适用。我们表明,我们的提名计划导致准确的提名下生成模型的随机图,大约是低秩,可能与成对的边缘相关。我们说明了我们的算法的性能,通过模拟研究合成数据,以及分析高中的友谊网络和分析的网页之间的转换率在必应搜索引擎。
英文摘要:
Given a network and a subset of interesting vertices whose identities are only partially known, the vertex nomination problem seeks to rank the remaining vertices in such a way that the interesting vertices are ranked at the top of the list. An important variant of this problem is vertex nomination in the multi-graphs setting. Given two graphs $G_1, G_2$ with common vertices and a vertex of interest $x \in G_1$, we wish to rank the vertices of $G_2$ such that the vertices most similar to $x$ are ranked at the top of the list. The current paper addresses this problem and proposes a method that first applies adjacency spectral graph embedding to embed the graphs into a common Euclidean space, and then solves a penalized linear assignment problem to obtain the nomination lists. Since the spectral embedding of the graphs are only unique up to orthogonal transformations, we present two approaches to eliminate this potential non-identifiability. One approach is based on orthogonal Procrustes and is applicable when there are enough vertices with known correspondence between the two graphs. Another approach uses adaptive point set registration and is applicable when there are few or no vertices with known correspondence. We show that our nomination scheme leads to accurate nomination under a generative model for pairs of random graphs that are approximately low-rank and possibly with pairwise edge correlations. We illustrate our algorithm's performance through simulation studies on synthetic data as well as analysis of a high-school friendship network and analysis of transition rates between web pages on the Bing search engine.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。