Vertex nomination via seeded graph matching

DOI10.1002/sam.11454OpenAlexW3011549831MaRDI QIDQ4970326

Heather G. Patsolic, Youngser Park, Vince Lyzinski, Carey E. Priebe

Publication date: 14 October 2020

Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.00674

zbMATH Keywords

graph matchingstochastic block modelgraph inferencegraph miningvertex nominationseeded graph matching

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Related Items (6)

Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming ⋮ Subgraph nomination: query by example subgraph retrieval in networks ⋮ Vertex nomination, consistent estimation, and adversarial modification ⋮ Graph matching beyond perfectly-overlapping Erdős--Rényi random graphs ⋮ Vertex nomination: the canonical sampling and the extended spectral nomination schemes ⋮ Unnamed Item

Uses Software

• MI-GRAAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unsupervised learning for graph matching
• Spectral clustering and the high-dimensional stochastic blockmodel
• Scan statistics on Enron graphs
• Vertex nomination schemes for membership prediction
• Consistent nonparametric regression. Discussion
• Localized algorithms for multiple kernel learning
• Mixed membership stochastic blockmodels
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• Locality Statistics for Anomaly Detection in Time Series of Graphs
• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• On a two-truths phenomenon in spectral graph clustering
• Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs
• Random Dot Product Graph Models for Social Networks

This page was built for publication: Vertex nomination via seeded graph matching