Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming

DOI10.1080/10618600.2022.2060238OpenAlexW3096910355MaRDI QIDQ5057261

Minh Tang, Runbing Zheng, Carey E. Priebe, Vince Lyzinski

Publication date: 16 December 2022

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

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

zbMATH Keywords

point set registrationvertex nominationcorrelated graphsgeneralized random dot product graphs

Mathematics Subject Classification ID

Statistics (62-XX)

Uses Software

• mclust
• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• Vertex nomination schemes for membership prediction
• Automatic dimensionality selection from the scree plot via the use of profile likelihood
• Vertex nomination, consistent estimation, and adversarial modification
• Vertex nomination: the canonical sampling and the extended spectral nomination schemes
• A generalized solution of the orthogonal Procrustes problem
• Partial singular value decomposition algorithm
• A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
• Eigenvalue Ratio Test for the Number of Factors
• Mixed membership stochastic blockmodels
• Graph limits and exchangeable random graphs
• The polynomial solvability of convex quadratic programming
• Latent Space Approaches to Social Network Analysis
• Vertex nomination via seeded graph matching
• Seeded graph matching for correlated Erd\H{o}s-R\'enyi graphs
• Random Dot Product Graph Models for Social Networks
• Letter to the Editor—The Multidimensional Assignment Problem

This page was built for publication: Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming