{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T20:37:16Z","timestamp":1790800636998,"version":"4.1.0"},"reference-count":65,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T00:00:00Z","timestamp":1678320000000},"content-version":"vor","delay-in-days":279,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Spectral embedding is a procedure which can be used to obtain vector representations of the nodes of a graph. This paper proposes a generalisation of the latent position network model known as the random dot product graph, to allow interpretation of those vector representations as latent position estimates. The generalisation is needed to model heterophilic connectivity (e.g. \u2018opposites attract\u2019) and to cope with negative eigenvalues more generally. We show that, whether the adjacency or normalised Laplacian matrix is used, spectral embedding produces uniformly consistent latent position estimates with asymptotically Gaussian error (up to identifiability). The standard and mixed membership stochastic block models are special cases in which the latent positions take only K distinct vector values, representing communities, or live in the (K \u2212 1)-simplex with those vertices respectively. Under the stochastic block model, our theory suggests spectral clustering using a Gaussian mixture model (rather than K-means) and, under mixed membership, fitting the minimum volume enclosing simplex, existing recommendations previously only supported under non-negative-definite assumptions. Empirical improvements in link prediction (over the random dot product graph), and the potential to uncover richer latent structure (than posited under the standard or mixed membership stochastic block models) are demonstrated in a cyber-security example.<\/jats:p>","DOI":"10.1111\/rssb.12509","type":"journal-article","created":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T08:22:53Z","timestamp":1654244573000},"page":"1446-1473","source":"Crossref","is-referenced-by-count":70,"title":["A Statistical Interpretation of Spectral Embedding: The Generalised Random Dot Product Graph"],"prefix":"10.1093","volume":"84","author":[{"given":"Patrick","family":"Rubin-Delanchy","sequence":"first","affiliation":[{"name":"School of Mathematics , Bristol , UK"},{"name":"University of Bristol , Bristol , UK"},{"name":"School of Mathematics University of Bristol , Bristol , UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joshua","family":"Cape","sequence":"additional","affiliation":[{"name":"University of Pittsburgh , Pittsburgh , Pennsylvania , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minh","family":"Tang","sequence":"additional","affiliation":[{"name":"North Carolina State University , Raleigh , North Carolina , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carey E.","family":"Priebe","sequence":"additional","affiliation":[{"name":"Johns Hopkins University , Baltimore , Maryland , USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2022,6,3]]},"reference":[{"issue":"1","key":"2023030906301643100_","first-page":"6446","article-title":"Community detection and stochastic block models: recent developments","volume":"18","author":"Abbe","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"2023030906301643100_","volume-title":"On two distinct sources of nonidentifiability in latent position random graph models","author":"Agterberg","year":"2020"},{"issue":"Sep","key":"2023030906301643100_","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"Airoldi","year":"2008","journal-title":"Journal of Machine Learning Research"},{"issue":"4","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1016\/0047-259X(81)90099-3","article-title":"Representations for partially exchangeable arrays of random variables","volume":"11","author":"Aldous","year":"1981","journal-title":"Journal of Multivariate Analysis"},{"issue":"1","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13171-015-0071-x","article-title":"A limit theorem for scaled eigenvectors of random dot product graphs","volume":"78","author":"Athreya","year":"2016","journal-title":"Sankhya A"},{"issue":"1","key":"2023030906301643100_","first-page":"8393","article-title":"Statistical inference on random dot product graphs: a survey","volume":"18","author":"Athreya","year":"2017","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1214\/20-STS787","article-title":"On estimation and inference in latent structure random graphs","volume":"36","author":"Athreya","year":"2021","journal-title":"Statistical Science"},{"key":"2023030906301643100_","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix analysis","author":"Bhatia","year":"1997"},{"issue":"4","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0378-8733(99)00019-2","article-title":"Models of core\/periphery structures","volume":"21","author":"Borgatti","year":"2000","journal-title":"Social Networks"},{"issue":"1","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/biomet\/asy070","article-title":"Signal-plus-noise matrix models: eigenvector deviations and fluctuations","volume":"106","author":"Cape","year":"2019","journal-title":"Biometrika"},{"issue":"5","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1214\/18-AOS1752","article-title":"The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics","volume":"47","author":"Cape","year":"2019","journal-title":"The Annals of Statistics"},{"issue":"5","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","article-title":"Lower bounds for the partitioning of graphs","volume":"17","author":"Donath","year":"1973","journal-title":"IBM Journal of Research and Development"},{"key":"2023030906301643100_","first-page":"2279","article-title":"Spectral statistics of Erd\u02dds-R\u00e9nyi' graphs I: local semicircle law","volume":"41","author":"Erd\u02dds","year":"2013","journal-title":"The Annals of Probability"},{"key":"2023030906301643100_","volume-title":"Potterverse","author":"Evans","year":"2014"},{"issue":"2","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler","year":"1973","journal-title":"Czechoslovak Mathematical Journal"},{"issue":"2","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s003579900058","article-title":"MCLUST: software for model-based cluster analysis","volume":"16","author":"Fraley","year":"1999","journal-title":"Journal of Classification"},{"issue":"458","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1198\/016214502760047131","article-title":"Model-based clustering, discriminant analysis, and density estimation","volume":"97","author":"Fraley","year":"2002","journal-title":"Journal of the American Statistical Association"},{"key":"2023030906301643100_","volume-title":"Curves and surfaces in geometric modeling: theory and algorithms","author":"Gallier","year":"2000"},{"key":"2023030906301643100_","doi-asserted-by":"crossref","DOI":"10.1109\/ISI.2016.7745478","volume-title":"Network-wide anomaly detection via the Dirichlet process","author":"Heard","year":"2016"},{"key":"2023030906301643100_","volume-title":"Internet of things: research study","author":"Hewlett Packard Enterprise research study","year":"2015"},{"key":"2023030906301643100_","volume-title":"Advances in neural information processing systems","author":"Hoff","year":"2008"},{"issue":"460","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1198\/016214502388618906","article-title":"Latent space approaches to social network analysis","volume":"97","author":"Hoff","year":"2002","journal-title":"Journal of the American Statistical Association"},{"issue":"2","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","article-title":"Stochastic blockmodels: first steps","volume":"5","author":"Holland","year":"1983","journal-title":"Social Networks"},{"key":"2023030906301643100_","volume-title":"Princeton, NJ: Institute for Advanced Study, Preprint","author":"Hoover","year":"1979"},{"issue":"1","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"16107","DOI":"10.1103\/PhysRevE.83.016107","article-title":"Stochastic blockmodels and community structure in networks","volume":"83","author":"Karrer","year":"2011","journal-title":"Physical Review E"},{"key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1142\/9781786340757_0002","volume-title":"Dynamic networks and cyber-security","author":"Kent","year":"2016"},{"key":"2023030906301643100_","volume-title":"Cybersecurity data sources for dynamic network research","author":"Kent","year":"2016"},{"issue":"3","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1162\/artl_a_00001","article-title":"Concurrency and network disassortativity","volume":"16","author":"Khor","year":"2010","journal-title":"Artificial Life"},{"issue":"5","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3344548","article-title":"Extraction and analysis of fictional character networks: a survey","volume":"52","author":"Labatut","year":"2019","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"2","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1214\/20-AOS1976","article-title":"Network representation using graph root distributions","volume":"49","author":"Lei","year":"2021","journal-title":"The Annals of Statistics"},{"issue":"1","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1214\/14-AOS1274","article-title":"Consistency of spectral clustering in stochastic block models","volume":"43","author":"Lei","year":"2015","journal-title":"The Annals of Statistics"},{"key":"2023030906301643100_","volume-title":"Identifying top sellers in underground economy using deep learningbased sentiment analysis","author":"Li","year":"2014"},{"issue":"8","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"1946","DOI":"10.1109\/TSP.2015.2508778","article-title":"A fast hyperplane-based minimumvolume enclosing simplex algorithm for blind hyperspectral unmixing","volume":"64","author":"Lin","year":"2016","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"2","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Transactions on Information Theory"},{"key":"2023030906301643100_","volume-title":"Large networks and graph limits. American Mathematical Society Colloquium Publications","author":"Lov\u00e1sz","year":"2012"},{"issue":"4","key":"2023030906301643100_","doi-asserted-by":"crossref","DOI":"10.37236\/3576","article-title":"Spectra of edge-independent random graphs","volume":"20","author":"Lu","year":"2013","journal-title":"Electronic Journal of Combinatorics"},{"issue":"2","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"2905","DOI":"10.1214\/14-EJS978","article-title":"Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding","volume":"8","author":"Lyzinski","year":"2014","journal-title":"Electronic Journal of Statistics"},{"issue":"1","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/TNSE.2016.2634322","article-title":"Community detection and classification in hierarchical stochastic blockmodels","volume":"4","author":"Lyzinski","year":"2017","journal-title":"IEEE Transactions on Network Science and Engineering"},{"issue":"Nov","key":"2023030906301643100_","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Maaten","year":"2008","journal-title":"Journal of Machine Learning Research"},{"issue":"536","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"1928","DOI":"10.1080\/01621459.2020.1751645","article-title":"Estimating mixed memberships with sharp eigenvector deviations","volume":"116","author":"Mao","year":"2021","journal-title":"Journal of the American Statistical Association"},{"key":"2023030906301643100_","volume-title":"CSNE: conditional signed network embedding","author":"Mara","year":"2020"},{"issue":"4","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1080\/00401706.2013.822830","article-title":"Scan statistics for the online detection of locally anomalous subgraphs","volume":"55","author":"Neil","year":"2013","journal-title":"Technometrics"},{"key":"2023030906301643100_","volume-title":"Towards improved detection of attackers in computer networks: new edges, fast updating, and host agents","author":"Neil","year":"2013"},{"key":"2023030906301643100_","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks: an introduction","author":"Newman","year":"2018"},{"key":"2023030906301643100_","volume-title":"PhD thesis, Johns Hopkins University","author":"Nickel","year":"2006"},{"key":"2023030906301643100_","first-page":"1","article-title":"Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodel","author":"Passino","year":"2022","journal-title":"Technometrics"},{"issue":"13","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"5995","DOI":"10.1073\/pnas.1814462116","article-title":"On a two-truths phenomenon in spectral graph clustering","volume":"116","author":"Priebe","year":"2019","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2023030906301643100_","volume-title":"Advances in neural information processing systems","author":"Qin","year":"2013"},{"issue":"4","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"1878","DOI":"10.1214\/11-AOS887","article-title":"Spectral clustering and the high-dimensional stochastic blockmodel","volume":"39","author":"Rohe","year":"2011","journal-title":"The Annals of Statistics"},{"issue":"1","key":"2023030906301643100_","first-page":"3040","article-title":"A note on quickly sampling a sparse matrix with low rank expectation","volume":"19","author":"Rohe","year":"2018","journal-title":"Journal of Machine Learning Research"},{"key":"2023030906301643100_","first-page":"11687","volume-title":"Advances in neural information processing systems","author":"Rubin-Delanchy","year":"2020"},{"key":"2023030906301643100_","volume-title":"Disassortivity of computer networks","author":"Rubin-Delanchy","year":"2016"},{"key":"2023030906301643100_","volume-title":"Consistency of adjacency spectral embedding for the mixed membership stochastic blockmodel","author":"Rubin-Delanchy","year":"2017"},{"issue":"3","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1214\/14-AOS1285","article-title":"Role of normalization in spectral clustering for stochastic blockmodels","volume":"43","author":"Sarkar","year":"2015","journal-title":"The Annals of Statistics"},{"issue":"8","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"804","key":"2023030906301643100_","first-page":"801","article-title":"Sur la division des corp mat\u00e9riels en parties","volume":"1","author":"Steinhaus","year":"1956","journal-title":"Bulletin L'Acad\u00e9mie Polonaise des Sciences"},{"issue":"499","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1080\/01621459.2012.699795","article-title":"A consistent adjacency spectral embedding for stochastic blockmodel graphs","volume":"107","author":"Sussman","year":"2012","journal-title":"Journal of the American Statistical Association"},{"issue":"5","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"2360","DOI":"10.1214\/17-AOS1623","article-title":"Limit theorems for eigenvectors of the normalized Laplacian for random graphs","volume":"46","author":"Tang","year":"2018","journal-title":"The Annals of Statistics"},{"key":"2023030906301643100_","volume-title":"Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral","author":"Tang","year":"2017"},{"key":"2023030906301643100_","volume-title":"Learning 1-dimensional submanifolds for subsequent inference on random dot product graphs","author":"Trosset","year":"2020"},{"issue":"4","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","author":"Von Luxburg","year":"2007","journal-title":"Statistics and Computing"},{"key":"2023030906301643100_","volume-title":"Matrix factorisation and the interpretation of geodesic distance","author":"Whiteley","year":"2021"},{"key":"2023030906301643100_","volume-title":"International workshop on algorithms and models for the web-graph","author":"Young","year":"2007"},{"issue":"2","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1093\/biomet\/asv008","article-title":"A useful variant of the Davis-Kahan theorem for statisticians","volume":"102","author":"Yu","year":"2015","journal-title":"Biometrika"},{"issue":"2","key":"2023030906301643100_","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1016\/j.csda.2005.09.010","article-title":"Automatic dimensionality selection from the scree plot via the use of profile likelihood","volume":"51","author":"Zhu","year":"2006","journal-title":"Computational Statistics & Data Analysis"}],"container-title":["Journal of the Royal Statistical Society Series B: Statistical Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/rssb.12509","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1111\/rssb.12509","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/84\/4\/1446\/49463140\/jrsssb_84_4_1446.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jrsssb\/article-pdf\/84\/4\/1446\/49463140\/jrsssb_84_4_1446.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T11:40:16Z","timestamp":1700653216000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jrsssb\/article\/84\/4\/1446\/7073272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,3]]},"references-count":65,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,6,3]]},"published-print":{"date-parts":[[2022,9,1]]}},"URL":"https:\/\/doi.org\/10.1111\/rssb.12509","relation":{},"ISSN":["1369-7412","1467-9868"],"issn-type":[{"value":"1369-7412","type":"print"},{"value":"1467-9868","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2022,9]]},"published":{"date-parts":[[2022,6,3]]}}}