Fetching the paper…
Reading the bibliography…
The random dot product graph (RDPG) is an independent-edge random graph that is analytically tractable and, simultaneously, either encompasses or can successfully approximate a wide range of random graphs, from relatively simple stochastic block models to complex latent position graphs.
The approximation of one matrix by another of lower rank
Carl Eckart and Gale Young · 1936
Earlier work this paper cites.
Questions and answer
F. Mosteller and R. A. Fisher · 1948
Earlier work this paper cites.
On the upper and lower bounds of eigenvalues
T. Kato · 1950
Earlier work this paper cites.
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
H. Chernoff · 1952
Earlier work this paper cites.
Large sample theory: Parametric case
H. Chernoff · 1956
Earlier work this paper cites.
Random graphs
E. N. Gilbert · 1959
Earlier work this paper cites.
On the evolution of random graphs
P. Erdös and A. Renyi · 1960
Earlier work this paper cites.
A general class of coefficients of divergence of one distribution from another
S. M. Ali and S. D. Shelvey · 1966
Earlier work this paper cites.
Information-type measures of difference of probability distributions and indirect observations
I. Csizár · 1967
Earlier work this paper cites.
The rotation of eigenvectors by a pertubation. III
C. Davis and W. Kahan · 1970
Earlier work this paper cites.
The rotation of eigenvectors by a perturbation
C. Davis and W. M. Kahan · 1970
Earlier work this paper cites.
Algebraic connectivity of graphs
M. Fiedler · 1973
Earlier work this paper cites.
A new look at the statistical model identification
Hirotugu Akaike · 1974
Earlier work this paper cites.
Modeling by shortest data description
J. Rissanen · 1978
Earlier work this paper cites.
Estimating the dimension of a model
Gideon Schwarz · 1978
Earlier work this paper cites.
The eigenvalues of random symmetric matrices
Z. Füredi and J. Komlós · 1981
Earlier work this paper cites.
Strong consistency of k k -means clustering
D. Pollard · 1981
Earlier work this paper cites.
Stochastic blockmodels: First steps
P. W. Holland, K. Laskey, and S. Leinhardt · 1983
Earlier work this paper cites.
The geometry of mixture likelihoods: A general theory
Bruce G. Lindsay · 1983
Earlier work this paper cites.
Matrix Analysis
R. Horn and C. Johnson · 1985
Earlier work this paper cites.
Stochastic blockmodels for directed graphs
Y J Wang and G Y Wong · 1987
Earlier work this paper cites.
Reducing multidimensional two-sample data to one-dimensional interpoint comparisons
J.-F. Maa, D. K. Pearl, and R. Bartoszyński · 1996
Earlier work this paper cites.
Matrix Analysis
R. Bhatia · 1997
Earlier work this paper cites.
Spectral Graph Theory
F. R. K. Chung · 1997
Earlier work this paper cites.
On the asymptotics of M-hypothesis bayesian detection
C. C. Leang and D. H. Johnson · 1997
Earlier work this paper cites.
Estimation and prediction for stochastic blockmodels for graphs with latent block structure
T. A. B. Snijders and K.Nowicki · 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.
Statistical pattern recognition: A review
Anil K. Jain, Robert P. W. Duin, and Jianchang Mao · 2000
Earlier work this paper cites.
A course in probability theory
K. L. Chung · 2001
Earlier work this paper cites.
On the influence of the kernel on the consistency of support vector machines
I. Steinwart · 2001
Earlier work this paper cites.
Model-based clustering, discriminant analysis and density estimation
C. Fraley and A. E. Raftery · 2002
Earlier work this paper cites.
Latent space approaches to social network analysis
P. D. Hoff, A. E. Raftery, and M. S. Handcock · 2002
Earlier work this paper cites.
A User’s Guide to Principal Components
J. Edward Jackson · 2004
Earlier work this paper cites.
On divergences and informations in statistics and information theory
F. Liese and I. Vadja · 2006
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.
The phase transition in inhomogeneous random graphs
B. Bollobás, S. Janson, and O. Riordan · 2007
Cited alongside, same era.
A tutorial on spectral clustering
U. Von Luxburg · 2007
Cited alongside, same era.
Random dot product graph models for social networks
S. Young and E. Scheinerman · 2007
Cited alongside, same era.
Mixed membership stochastic blockmodels
E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing · 2008
Cited alongside, same era.
The Probabilistic Method
N. Alon and J. Spencer · 2008
Cited alongside, same era.
A nonparametric view of network models and Newman-Girvan and other modularities
P. J. Bickel and A. Chen · 2009
Cited alongside, same era.
Vertex nomination
G. A. Coppersmith · 2014
Later among the works it cites.
Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
V. Lyzinski, D. L. Sussman, M. Tang, A. Athreya, and C. E. Priebe · 2014
Later among the works it cites.
Belief propagation, robust reconstruction and optimal recovery of block models
Elchanan Mossel, Joe Neeman, and Allan Sly · 2014
Later among the works it cites.
Consistent latent position estimation and vertex classification for random dot product graphs
D. L. Sussman, M. Tang, and C. E. Priebe · 2014
Later among the works it cites.
Consistent latent position estimation and vertex classification for random dot product graphs
D. L. Sussman, M. Tang, and C. E. Priebe · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. J. Bickel and A. Chen · 2009
Cited alongside, same era.
Statistical Analysis of Network Data
E. D. Kolaczyk · 2009
Cited alongside, same era.
Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges
R. I. Oliveira · 2009
Cited alongside, same era.
Community detection in graphs
S. Fortunato · 2010
Cited alongside, same era.
A survey of statistical network models
A. Goldenberg, A. X. Zheng, S. E. Fienberg, and E. M. Airoldi · 2010
Cited alongside, same era.
Modeling graphs using dot product representations
Edward R Scheinerman and Kimberly Tucker · 2010
Cited alongside, same era.
S. Suwan, D.S Lee, R. Tang, D.L. Sussman, M. Tang, and C.E. Priebe · 2014
Later among the works it cites.
Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery
E Abbe and C Sandon · 2015
Later among the works it cites.
Role of normalization for spectral clustering in stochastic blockmodels
P. Bickel and P. Sarkar · 2015
Later among the works it cites.
Matrix estimation by universal singular value thresholding
Sourav Chatterjee · 2015
Later among the works it cites.
Vertex nomination schemes for membership prediction
D. E. Fishkind, V. Lyzinski, H. Pao, L. Chen, and C. E. Priebe · 2015
Later among the works it cites.
On the incommensurability phenomenon
D. E. Fishkind, C. Shen, and C. E. Priebe · 2015
Later among the works it cites.
Limitations in the spectral method for graph partitioning: detectability threshold and localization of eigenvectors
Tatsuro Kawamoto and Yoshiyuki Kabashima · 2015
Later among the works it cites.
Consistency of spectral clustering in stochastic blockmodels
J. Lei and A. Rinaldo · 2015
Later among the works it cites.
A multilevel multimodal circuit enhances action selection in drosophila
Tomoko Ohyama, Casey M Schneider-Mizell, Richard D Fetter, Javier Valdes Aleman, Romain Franconville, Marta Rivera-Alba, Brett D Mensh, Kristin M Branson, Julie H Simpson, James W Truman, et al · 2015
Later among the works it cites.
An introduction to matrix concentration inequalities
J. A. Tropp · 2015
Later among the works it cites.
A useful variant of the Davis-Kahan theorem for statisticians
Y. Yu, T. Wang, and R. J. Samworth · 2015
Later among the works it cites.
Flashgraph: Processing billion-node graphs on an array of commodity ssds
D. Zheng, D. Mhembere, R. Burns, J. T. Vogelstein, C. E. Priebe, and A. S. Szalay · 2015
Later among the works it cites.
Exact recovery in the stochastic block model
E Abbe, A S Bandeira, and G Hall · 2016
Later among the works it cites.
A limit theorem for scaled eigenvectors of random dot product graphs
A. Athreya, V. Lyzinski, D. J. Marchette, C. E. Priebe, D. L. Sussman, and M. Tang · 2016
Later among the works it cites.
The kato-temple inequality and eigenvalue concentration
J. C. Cape, M. Tang, and C. E. Priebe · 2016
Later among the works it cites.
A joint graph inference case study: the c. elegans chemical and electrical connectomes
L. Chen, J.T. Vogelstein, V. L. Lyzinski, and C. E. Priebe · 2016
Later among the works it cites.
A goodness-of-fit test for stochastic block models
J. Lei · 2016
Later among the works it cites.
Graph matching: Relax at your own risk
V. Lyzinski, D. E. Fishkind, M. Fiori, J. T. Vogelstein, C. E. Priebe, and G. Sapiro · 2016
Later among the works it cites.
On the consistency of the likelihood maximization vertex nomination scheme: Bridging the gap between maximum likelihood estimation and graph matching
V. Lyzinski, K. Levin, D. Fishkind, and C. E. Priebe · 2016
Later among the works it cites.
Quantitative neuroanatomy for connectomics in drosophila
Casey M Schneider-Mizell, Stephan Gerhard, Mark Longair, Tom Kazimiers, Feng Li, Maarten F Zwart, Andrew Champion, Frank M Midgley, Richard D Fetter, Stephan Saalfeld, et al · 2016
Later among the works it cites.
A semiparametric two-sample hypothesis testing problem for random dot product graphs
M. Tang, A. Athreya, D. L. Sussman, V. Lyzinski, Y. Park, and C. E. Priebe · 2016
Later among the works it cites.
Limit theorems for eigenvectors of the normalized laplacian for random graphs
M. Tang and C. E. Priebe · 2016
Later among the works it cites.
R. Tang, M. Ketcha, J. T. Vogelstein, C. E. Priebe, and D. L. Sussman · 2016
Later among the works it cites.
Joshua Cape, M. Tang, and C. E. Priebe · 2017
Closest in time.
The complete wiring diagram of a high-order learning and memory center, the insect mushroom body
K Eichler, F Li, A L Kumar, Y Park, I Andrade, C Schneider-Mizell, T Saumweber, A Huser, D Bonnery, B Gerber, R D Fetter, J W Truman, Carey E Priebe, L F Abbott, A Thum, M Zlatic, and A Cardona · 2017
Closest in time.
Concentration and regularization of random graphs
Can M Le, Elizaveta Levina, and Roman Vershynin · 2017
Closest in time.
A central limit theorem for an omnibus embedding of random dot product graphs
K. Levin, A. Athreya, M. Tang, V. Lyzinski, and C. E. Priebe · 2017
Closest in time.
Laplacian eigenmaps from sparse, noisy similarity measurements
K. Levin and V. Lyzinski · 2017
Closest in time.
Community detection and classification in hierarchical stochastic blockmodels
V. Lyzinski, M. Tang, A. Athreya, Y. Park, and C. E. Priebe · 2017
Closest in time.
Semiparametric spectral modeling of the drosophila connectome
C.E. Priebe, Y. Park, M. Tang, Avanti Athreya, V. Lyzinski, J. T. Vogelstein, Y. Qin, B. Cocanougher, K. Eichler, M. Zlatic, and A. Cardona · 2017
Closest in time.
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
Closest in time.