Vertex nomination between graphs via spectral embedding and quadratic programming

10/24/2020
by   Runbing Zheng, et al.
0

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 ∈ 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.

READ FULL TEXT

page 24

page 25

page 28

research
05/06/2019

Vertex Nomination, Consistent Estimation, and Adversarial Modification

Given a pair of graphs G_1 and G_2 and a vertex set of interest in G_1, ...
research
01/17/2021

Simultaneous Embedding of Colored Graphs

A set of colored graphs are compatible, if for every color i, the number...
research
04/28/2022

Sums of Distances on Graphs and Embeddings into Euclidean Space

Let G=(V,E) be a finite, connected graph. We consider a greedy selection...
research
09/24/2020

A Note on Toroidal Maxwell-Cremona Correspondences

We explore toroidal analogues of the Maxwell-Cremona correspondence. Eri...
research
02/14/2018

Vertex nomination: The canonical sampling and the extended spectral nomination schemes

Suppose that one particular block in a stochastic block model is deemed ...
research
10/05/2019

Change Detection in Noisy Dynamic Networks: A Spectral Embedding Approach

Change detection in dynamic networks is an important problem in many are...
research
03/15/2023

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator

We study the lift-and-project rank of the stable set polytopes of graphs...

Please sign up or login with your details

Forgot password? Click here to reset