Vertex nomination via seeded graph matching
نویسندگان
چکیده
منابع مشابه
Vertex Nomination via Content and Context
If I know of a few persons of interest, how can a combination of human language technology and graph theory help me find other people similarly interesting? If I know of a few people committing a crime, how can I determine their co-conspirators? Given a set of actors deemed interesting, we seek other actors who are similarly interesting. We use a collection of communications encoded as an attri...
متن کاملVertex nomination via attributed random dot product graphs
The vertex nomination problem addressed in this paper, introduced in Coppersmith and Priebe [2011] and illustrated in Figure 1, involves a (simple, undirected) graph in which vertices have associated attributes (“1” and “2”, say; black and white in the figure). However, we observe the vertex attributes for only a (small) subset of the vertices. One of the vertex attributes identifies vertices o...
متن کاملOn the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
Given a graph in which a few vertices are deemed interesting a priori, the vertex nomination task is to order the remaining vertices into a nomination list such that there is a concentration of interesting vertices at the top of the list. Previous work has yielded several approaches to this problem, with theoretical results in the setting where the graph is drawn from a stochastic block model (...
متن کاملSeeded Graph Matching: Efficient Algorithms and Theoretical Guarantees
In this paper, a new information theoretic framework for graph matching is introduced. Using this framework, the graph isomorphism and seeded graph matching problems are studied. The maximum degree algorithm for graph isomorphism is analyzed and sufficient conditions for successful matching are rederived using type analysis. Furthermore, a new seeded matching algorithm with polynomial time comp...
متن کاملSeeded graph matching for correlated Erdös-Rényi graphs
Graph matching is an important problem in machine learning and pattern recognition. Herein, we present theoretical and practical results on the consistency of graph matching for estimating a latent alignment function between the vertex sets of two graphs, as well as subsequent algorithmic implications when the latent alignment is partially observed. In the correlated Erdős-Rényi graph setting, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Analysis and Data Mining: The ASA Data Science Journal
سال: 2020
ISSN: 1932-1864,1932-1872
DOI: 10.1002/sam.11454