Vertex Nomination, Consistent Estimation, and Adversarial Modification

05/06/2019
by   Joshua Agterberg, et al.
0

Given a pair of graphs G_1 and G_2 and a vertex set of interest in G_1, the vertex nomination problem seeks to find the corresponding vertices of interest in G_2 (if they exist) and produce a rank list of the vertices in G_2, with the corresponding vertices of interest in G_2 concentrating, ideally, at the top of the rank list. In this paper we study the effect of an adversarial contamination model on the performance of a spectral graph embedding-based vertex nomination scheme. In both real and simulated examples, we demonstrate that this vertex nomination scheme performs effectively in the uncontaminated setting; adversarial network contamination adversely impacts the performance of our VN scheme; and network regularization successfully mitigates the impact of the contamination. In addition to furthering the theoretic basis of consistency in vertex nomination, the adversarial noise model posited herein is grounded in theoretical developments that allow us to frame the role of an adversary in terms of maximal vertex nomination consistency classes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/24/2020

Vertex nomination between graphs via spectral embedding and quadratic programming

Given a network and a subset of interesting vertices whose identities ar...
research
11/15/2017

On consistent vertex nomination schemes

Given a vertex of interest in a network G_1, the vertex nomination probl...
research
04/29/2020

On the role of features in vertex nomination: Content and context together are better (sometimes)

Vertex nomination is a lightly-supervised network information retrieval ...
research
08/20/2022

Adversarial contamination of networks in the setting of vertex nomination: a new trimming method

As graph data becomes more ubiquitous, the need for robust inferential g...
research
03/12/2020

Topological Effects on Attacks Against Vertex Classification

Vertex classification is vulnerable to perturbations of both graph topol...
research
12/10/2013

Vertex nomination schemes for membership prediction

Suppose that a graph is realized from a stochastic block model where one...

Please sign up or login with your details

Forgot password? Click here to reset