Fetching the paper…
Reading the bibliography…
Given a pair of graphs $G_1$ and $G_2$ and a vertex set of interest in $G_1$, the vertex nomination (VN) problem seeks to find the corresponding vertices of interest in $G_2$ (if they exist) and produce a rank list of the vertices in $G_2$, with the corresponding vertices of interest in $G_2$ concentrating, ideally, at the top of the rank list.
A generalized solution of the orthogonal procrustes problem
P. H. Schönemann · 1966
Earlier work this paper cites.
Stochastic blockmodels: First steps
P. W. Holland, K. B. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
Respondent-driven sampling: a new approach to the study of hidden populations
D. D. Heckathorn · 1997
Earlier work this paper cites.
Mclust: Software for model-based cluster analysis
C. Fraley and A. E. Raftery · 1999
Earlier work this paper cites.
Community structure in social and biological networks
M. Girvan and M. E. J. Newman · 2002
Earlier work this paper cites.
Specificity and stability in topology of protein networks
S. Maslov and K. Sneppen · 2002
Earlier work this paper cites.
Network motifs: simple building blocks of complex networks
R. Milo, S. Shen-Orr, S. Itzkovitz, . Kashtan, D. Chklovskii, and U. Alon · 2002
Earlier work this paper cites.
Random graph models of social networks
M. E. J. Newman, D. J. Watts, and S. H. Strogatz · 2002
Earlier work this paper cites.
Thirty years of graph matching in pattern recognition
D. Conte, P. Foggia, C. Sansone, and M. Vento · 2004
Earlier work this paper cites.
Modularity and community structure in networks
M. E. J. Newman · 2006
Earlier work this paper cites.
Automatic dimensionality selection from the scree plot via the use of profile likelihood
M. Zhu and A. Ghodsi · 2006
Earlier work this paper cites.
Fast unfolding of communities in large networks
V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre · 2008
Earlier work this paper cites.
A nonparametric view of network models and Newman-Girvan and other modularities
P. J. Bickel and A. Chen · 2009
Earlier work this paper cites.
Complex brain networks: graph theoretical analysis of structural and functional systems
E. Bullmore and O. Sporns · 2009
Earlier work this paper cites.
7. respondent-driven sampling: An assessment of current methodology
K. J. Gile and M. S. Handcock · 2010
Earlier work this paper cites.
Adversarial machine learning
L. Huang, A. D. Joseph, B. Nelson, B. I. P. Rubinstein, and J. D. Tygar · 2011
Earlier work this paper cites.
Vertex nomination via attributed random dot product graphs
D. Marchette, C. E. Priebe, and G. Coppersmith · 2011
Earlier work this paper cites.
Spectral clustering and the high-dimensional stochastic blockmodel
K. Rohe, S. Chatterjee, and B. Yu · 2011
Cited alongside, same era.
Vertex nomination via content and context
G. A. Coppersmith and C. E. Priebe · 2012
Cited alongside, same era.
D. S. Lee and C. E. Priebe · 2012
Cited alongside, same era.
Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
P. J. Bickel, D. Choi, X. Chang, and H. Zhang · 2013
Cited alongside, same era.
Regularized spectral clustering under the degree-corrected stochastic blockmodel
T. Qin and K. Rohe · 2013
Cited alongside, same era.
A short survey of recent advances in graph matching
J. Yan, X. Yin, W. Lin, C. Deng, H. Zha, and X. Yang · 2016
Later among the works it cites.
Network classification with applications to brain connectomics
J. D Arroyo-Relión, D. Kessler, E. Levina, and S. F. Taylor · 2017
Later among the works it cites.
Statistical inference on random dot product graphs: a survey
A. Athreya, D. E. Fishkind, K. Levin, V. Lyzinski, Y. Park, Y. Qin, D. L. Sussman, M. Tang, J. T. Vogelstein, and C. E. Priebe · 2017
Later among the works it cites.
Concentration and regularization of random graphs
C. M. Le, E. Levina, and R. Vershynin · 2017
Later among the works it cites.
Community detection and classification in hierarchical stochastic blockmodels
V. Lyzinski, M. Tang, A. Athreya, Y. Park, and C. E. Priebe · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Graph classification using signal-subgraphs: Applications in statistical connectomics
J. T. Vogelstein, W. G. Roncal, R. J. Vogelstein, and C. E. Priebe · 2013
Cited alongside, same era.
Matrix estimation by universal singular value thresholding
S. Chatterjee · 2014
Cited alongside, same era.
Vertex nomination
G. Coppersmith · 2014
Cited alongside, same era.
Graph matching and learning in pattern recognition in the last 10 years
P. Foggia, G. Percannella, and M. Vento · 2014
Cited alongside, same era.
Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
V. Lyzinski, D. L. Sussman, M. Tang, A. Athreya, and C. E. Priebe · 2014
Cited alongside, same era.
Consistent latent position estimation and vertex classification for random dot product graphs
D. L. Sussman, M. Tang, and C. E. Priebe · 2014
Cited alongside, same era.
A limit theorem for scaled eigenvectors of random dot product graphs
A. Athreya, C.E. Priebe, M. Tang, V. Lyzinski, D.J. Marchette, and D.L. Sussman · 2015
Cited alongside, same era.
H. G. Patsolic, Y. Park, V. Lyzinski, and C. E. Priebe · 2017
Later among the works it cites.
Social network analysis
J. Scott · 2017
Later among the works it cites.
A semiparametric two-sample hypothesis testing problem for random graphs
M. Tang, A. Athreya, D. L. Sussman, V. Lyzinski, Y. Park, and C. E. Priebe · 2017
Later among the works it cites.
A nonparametric two-sample hypothesis testing problem for random dot product graphs
M. Tang, A. Athreya, D. L. Sussman, V. Lyzinski, and C. E. Priebe · 2017
Later among the works it cites.
Adversarial Attack on Graph Structured Data
H. Dai, H. Li, T. Tian, X. Huang, L. Wang, J. Zhu, and L. Song · 2018
Later among the works it cites.
Trimming the hairball: Edge cutting strategies for making dense graphs usable
D. Edge, J. Larson, M. Mobius, and C. White · 2018
Later among the works it cites.
Graph theory methods: applications in brain networks
O. Sporns · 2018
Later among the works it cites.
Vertex nomination: The canonical sampling and the extended spectral nomination schemes
J. Yoder, L. Chen, H. Pao, E. Bridgeford, K. Levin, D. E. Fishkind, C. E. Priebe, and V. Lyzinski · 2018
Later among the works it cites.
Adversarial Attacks on Neural Networks for Graph Data
D. Zügner, A. Akbarnejad, and S. Günnemann · 2018
Later among the works it cites.
The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
J. Cape, M. Tang, and C. E. Priebe · 2019
Closest in time.
On consistent vertex nomination schemes
V. Lyzinski, K. Levin, and C. E. Priebe · 2019
Closest in time.