Vertex nomination: the canonical sampling and the extended spectral nomination schemes

DOI10.1016/j.csda.2020.106916OpenAlexW3001635474WikidataQ126329589 ScholiaQ126329589MaRDI QIDQ2305315

Eric Bridgeford, Li Chen, Henry Pao, Donniell E. Fishkind, Keith Levin, Jordan Yoder, Vince Lyzinski, Carey E. Priebe

Publication date: 10 March 2020

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

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

zbMATH Keywords

mclustMarkov chain Monte Carlospectral partitioningvertex nomination

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (5)

Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming ⋮ 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 ⋮ Unnamed Item

Uses Software

• mclust
• BayesDA
• FSL
• Dipy
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Likelihood-based model selection for stochastic block models
• A limit theorem for scaled eigenvectors of random dot product graphs
• Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
• Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
• Spectral clustering and the high-dimensional stochastic blockmodel
• Vertex nomination schemes for membership prediction
• Automatic dimensionality selection from the scree plot via the use of profile likelihood
• What do we know about the Metropolis algorithm?
• Fast mixing of Metropolis-Hastings with unimodal targets
• Vertex nomination, consistent estimation, and adversarial modification
• Matrix estimation by universal singular value thresholding
• Mixed membership stochastic blockmodels
• Model-Based Clustering, Discriminant Analysis, and Density Estimation
• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• Stochastic Blockmodels for Directed Graphs
• Vertex nomination via seeded graph matching
• Semi-supervised k-means++
• Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
• Asymmetric graphs

This page was built for publication: Vertex nomination: the canonical sampling and the extended spectral nomination schemes