文章基本信息

标题：Vertex nomination, consistent estimation, and adversarial modification
本地全文：下载
作者：Joshua Agterberg ; Youngser Park ; Jonathan Larson 等
期刊名称：Electronic Journal of Statistics
印刷版ISSN：1935-7524
出版年度：2020
卷号：14
期号：2
页码：3230-3267
DOI：10.1214/20-EJS1744
语种：English
出版社：Institute of Mathematical Statistics
摘要：Given a pair of graphs $G_{1}$ and $G_{2}$ and a vertex set of interest in $G_{1}$, the vertex nomination (VN) 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 define and derive the analogue of Bayes optimality for VN with multiple vertices of interest, and we define the notion of maximal consistency classes in vertex nomination. This theory forms the foundation for a novel VN adversarial contamination model, and we demonstrate with real and simulated data that there are VN schemes that perform effectively in the uncontaminated setting, and adversarial network contamination adversely impacts the performance of our VN scheme. We further define a network regularization method for mitigating the impact of the adversarial contamination, and we demonstrate the effectiveness of regularization in both real and synthetic data.
关键词：Statistics;random graphs;networks;adversarial machine learning;vertex nomination