Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure

References

• Athreya, A., Fishkind, D. E., Tang, M., Priebe, C. E., Park, Y., Vogelstein, J. T., Levin, K., Lyzinski, V., Qin, Y., and Sussman, D. L. (2018a), “Statistical Inference on Random Dot Product Graphs: A Survey,” Journal of Machine Learning Research, 18, 1–92.
   Web of Science ®Google Scholar
• Athreya, A., Priebe, C. E., Tang, M., Lyzinski, V., Marchette, D. J., and Sussman, D. L. (2016), “A Limit Theorem for Scaled Eigenvectors of Random Dot Product Graphs,” Sankhya A, 78, 1–18. DOI: 10.1007/s13171-015-0071-x.
   Google Scholar
• Athreya, A., Tang, M., Park, Y., and Priebe, C. E. (2018b), “On Estimation and Inference in Latent Structure Random Graphs,” arXiv:1806.01401.
   Google Scholar
• Bhattacharya, A., and Dunson, D. B. (2011), “Sparse Bayesian Infinite Factor Models,” Biometrika, 291–306. DOI: 10.1093/biomet/asr013.
   PubMed Web of Science ®Google Scholar
• Bickel, P. J., and Doksum, K. A. (2015), Mathematical Statistics: Basic Ideas and Selected Topics, Vol. 2, CRC Press.
   Google Scholar
• Boucheron, S., Lugosi, G., and Massart, P. (2013), Concentration Inequalities: A Nonasymptotic Theory of Independence, Oxford: Oxford University Press.
   Google Scholar
• Caron, F., and Fox, E. B. (2017), “Sparse Graphs Using Exchangeable Random Measures.” Journal of the Royal Statistical Society, Series B, 79, 1295–1366. DOI: 10.1111/rssb.12233.
   Google Scholar
• Eckart, C., and Young, G. (1936), “The Approximation of One Matrix by Another of Lower Rank,” Psychometrika, 1, 211–218. DOI: 10.1007/BF02288367.
   Google Scholar
• Gao, C., Ma, Z., Zhang, A. Y., and Zhou, H. H. (2017), “Achieving Optimal Misclassification Proportion in Stochastic Block Models,” Journal of Machine Learning Research, 18, 1980–2024.
   Web of Science ®Google Scholar
• Geng, J., Bhattacharya, A., and Pati, D. (2019), “Probabilistic Community Detection With Unknown Number of Communities,” Journal of the American Statistical Association, 114, 893–905. DOI: 10.1080/01621459.2018.1458618.
   Web of Science ®Google Scholar
• Girvan, M., and Newman, M. E. J. (2002), “Community Structure in Social and Biological Networks,” Proceedings of the National Academy of Sciences, 99, 7821–7826. DOI: 10.1073/pnas.122653799.
   PubMed Web of Science ®Google Scholar
• Hoff, P. D., Raftery, A. E., and Handcock, M. S. (2002), “Latent Space Approaches to Social Network Analysis,” Journal of the American Statistical Association, 97, 1090–1098. DOI: 10.1198/016214502388618906.
   Web of Science ®Google Scholar
• Mele, A., Hao, L., Cape, J., and Priebe, C. E. (2019), “Spectral Inference for Large Stochastic Blockmodels With Nodal Covariates,” arXiv: 1908.06438.
   Google Scholar
• Merris, R. (1994), “Laplacian Matrices of Graphs: A Survey,” Linear Algebra and Its Applications, 197, 143–176. DOI: 10.1016/0024-3795(94)90486-3.
   Google Scholar
• Neil, J., Uphoff, B., Hash, C., and Storlie, C. (2013), “Towards Improved Detection of Attackers in Computer Networks: New Edges, Fast Updating, and Host Agents,” in 2013 6th International Symposium on Resilient Control Systems (ISRCS), pp. 218–224. DOI: 10.1109/ISRCS.2013.6623779.
   Google Scholar
• Nocedal, J., and Wright, S. (2006), Numerical Optimization, Springer Science & Business Media.
   Google Scholar
• Priebe, C. E., Park, Y., Tang, M., Athreya, A., Lyzinski, V., Vogelstein, J. T., Qin, Y., Cocanougher, B., Eichler, K., Zlatic, M. (2017), “Semiparametric Spectral Modeling of the Drosophila Connectome,” arXiv:1705.03297.
   Google Scholar
• Rocková, V., and George, E. I. (2016), “Fast Bayesian Factor Analysis Via Automatic Rotations to Sparsity,” Journal of the American Statistical Association, 111, 1608–1622. DOI: 10.1080/01621459.2015.1100620.
   Web of Science ®Google Scholar
• Rohe, K., Chatterjee, S., and Yu, B. (2011), “Spectral Clustering and the High-Dimensional Stochastic Blockmodel,” Annals of Statistics, 39, 1878–1915.
   Web of Science ®Google Scholar
• Rubin-Delanchy, P., Adams, N. M., and Heard, N. A. (2016), “Disassortativity of Computer Networks,” in 2016 IEEE Conference on Intelligence and Security Informatics (ISI), pp. 243–247. DOI: 10.1109/ISI.2016.7745482.
   Google Scholar
• Rubin-Delanchy, P., Cape, J., Tang, M., and Priebe, C. E. (2017), “A Statistical Interpretation of Spectral Embedding: The Generalised Random Dot Product Graph,” arXiv: 1709.05506.
   Google Scholar
• Sarkar, P., and Bickel, P. J. (2015), “Role of Normalization in Spectral Clustering for Stochastic Blockmodels,” Annals of Statistics, 43, 962–990.
   Web of Science ®Google Scholar
• Sussman, D. L., Tang, M., Fishkind, D. E., and Priebe, C. E. (2012), “A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs,” Journal of the American Statistical Association, 107, 1119–1128. DOI: 10.1080/01621459.2012.699795.
   Web of Science ®Google Scholar
• Sussman, D. L., Tang, M., and Priebe, C. E. (2014), “Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 36, 48–57. DOI: 10.1109/TPAMI.2013.135.
   PubMed Web of Science ®Google Scholar
• Tang, M., Athreya, A., Sussman, D. L., Lyzinski, V., Park, Y., and Priebe, C. E. (2017a), “A Semiparametric Two-Sample Hypothesis Testing Problem for Random Graphs,” Journal of Computational and Graphical Statistics, 26, 344–354. DOI: 10.1080/10618600.2016.1193505.
   Web of Science ®Google Scholar
• Tang, M., Athreya, A., Sussman, D. L., Lyzinski, V., and Priebe, C. E. (2017b), “A Nonparametric Two-Sample Hypothesis Testing Problem for Random Graphs,” Bernoulli, 23, 1599–1630. DOI: 10.3150/15-BEJ789.
   Web of Science ®Google Scholar
• Tang, M., and Priebe, C. E. (2018), “Limit Theorems for Eigenvectors of the Normalized Laplacian for Random Graphs,” Annals of Statistics, 46, 2360–2415.
   Web of Science ®Google Scholar
• Tang, M., Sussman, D. L., and Priebe, C. E. (2013), “Universally Consistent Vertex Classification for Latent Positions Graphs,” Annals of Statistics, 41, 1406–1430.
   Web of Science ®Google Scholar
• Tang, R., Ketcha, M., Badea, A., Calabrese, E. D., Margulies, D. S., Vogelstein, J. T., Priebe, C. E., and Sussman, D. L. (2019), “Connectome Smoothing Via Low-Rank Approximations,” IEEE Transactions on Medical Imaging, 38, 1446–1456. DOI: 10.1109/TMI.2018.2885968.
   PubMed Web of Science ®Google Scholar
• Van der Vaart, A. W. (2000), Asymptotic Statistics, Vol. 3, Cambridge: Cambridge University Press.
   Google Scholar
• Ward, M. D., Stovel, K., and Sacks, A. (2011), “Network Analysis and Political Science,” Annual Review of Political Science, 14, 245–264. DOI: 10.1146/annurev.polisci.12.040907.115949.
   Web of Science ®Google Scholar
• Wasserman, S., and Faust, K. (1994), Social Network Analysis: Methods and Applications, Vol. 8, Cambridge: Cambridge University Press.
   Google Scholar
• Xie, F., and Xu, Y. (2019), “Optimal Bayesian Estimation for Random Dot Product Graphs,” arXiv:1904.12070.
   Google Scholar
• Young, S. J., and Scheinerman, E. R. (2007), “Random Dot Product Graph Models for Social Networks,” in International Workshop on Algorithms and Models for the Web-Graph, Springer, pp. 138–149.
   Google Scholar
• Zhu, M., and Ghodsi, A. (2006), “Automatic Dimensionality Selection From the Scree Plot Via the Use of Profile Likelihood,” Computational Statistics & Data Analysis, 51, 918–930.
   Web of Science ®Google Scholar