Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming
From MaRDI portal
Cites work
- A generalized solution of the orthogonal Procrustes problem
- A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
- Automatic dimensionality selection from the scree plot via the use of profile likelihood
- Eigenvalue ratio test for the number of factors
- Graph clustering
- Graph limits and exchangeable random graphs
- Large networks and graph limits
- Latent Space Approaches to Social Network Analysis
- Letter to the Editor—The Multidimensional Assignment Problem
- Mixed membership stochastic blockmodels
- On consistent vertex nomination schemes
- On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching
- Partial singular value decomposition algorithm
- Random Dot Product Graph Models for Social Networks
- Regularized optimal transport and the rot mover's distance
- Seeded graph matching for correlated Erdős-Rényi graphs
- The polynomial solvability of convex quadratic programming
- Vertex nomination schemes for membership prediction
- Vertex nomination via seeded graph matching
- Vertex nomination, consistent estimation, and adversarial modification
- Vertex nomination: the canonical sampling and the extended spectral nomination schemes
This page was built for publication: Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057261)
