{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T21:15:04Z","timestamp":1790025304446,"version":"4.0.1"},"reference-count":34,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1940107"],"award-info":[{"award-number":["1940107"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1918854"],"award-info":[{"award-number":["1918854"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,1]]},"abstract":"<jats:title>Summary<\/jats:title>\n               <jats:p>We propose and prove the optimality of a Bayesian approach for estimating the latent positions in random dot product graphs, which we call posterior spectral embedding. Unlike classical spectral-based adjacency, or Laplacian spectral embedding, posterior spectral embedding is a fully likelihood-based graph estimation method that takes advantage of the Bernoulli likelihood information of the observed adjacency matrix. We develop a minimax lower bound for estimating the latent positions, and show that posterior spectral embedding achieves this lower bound in the following two senses: it both results in a minimax-optimal posterior contraction rate and yields a point estimator achieving the minimax risk asymptotically. The convergence results are subsequently applied to clustering in stochastic block models with positive semidefinite block probability matrices, strengthening an existing result concerning the number of misclustered vertices. We also study a spectral-based Gaussian spectral embedding as a natural Bayesian analogue of adjacency spectral embedding, but the resulting posterior contraction rate is suboptimal by an extra logarithmic factor. The practical performance of the proposed methodology is illustrated through extensive synthetic examples and the analysis of Wikipedia graph data.<\/jats:p>","DOI":"10.1093\/biomet\/asaa031","type":"journal-article","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T19:10:45Z","timestamp":1585941045000},"page":"875-889","source":"Crossref","is-referenced-by-count":10,"title":["Optimal Bayesian estimation for random dot product graphs"],"prefix":"10.1093","volume":"107","author":[{"given":"Fangzheng","family":"Xie","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Johns Hopkins University, 3400 North Charles Street, Baltimore, Maryland 21218, U.S.A"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanxun","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Johns Hopkins University, 3400 North Charles Street, Baltimore, Maryland 21218, U.S.A"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2020,7,6]]},"reference":[{"key":"2020121116434386400_B1","first-page":"1","article-title":"Statistical inference on random dot product graphs: A survey","volume":"18","author":"Athreya,","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"2020121116434386400_B2","article-title":"On estimation and inference in latent structure random graphs","author":"Athreya,","year":"2020"},{"key":"2020121116434386400_B3","doi-asserted-by":"crossref","first-page":"21068","DOI":"10.1073\/pnas.0907096106","article-title":"A nonparametric view of network models and Newman\u2013Girvan and other modularities","volume":"106","author":"Bickel,","year":"2009","journal-title":"Proc. Nat. Acad. Sci."},{"key":"2020121116434386400_B4","doi-asserted-by":"crossref","first-page":"2280","DOI":"10.1214\/11-AOS904","article-title":"The method of moments and degree distributions for network models","volume":"39","author":"Bickel,","year":"2011","journal-title":"Ann. Statist."},{"key":"2020121116434386400_B5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1214\/14-AOS1272","article-title":"Matrix estimation by universal singular value thresholding","volume":"43","author":"Chatterjee,","year":"2015","journal-title":"Ann. Statist."},{"key":"2020121116434386400_B6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1093\/biomet\/asr053","article-title":"Stochastic blockmodels with a growing number of classes","volume":"99","author":"Choi,","year":"2012","journal-title":"Biometrika"},{"key":"2020121116434386400_B7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","author":"Fortunato,","year":"2010","journal-title":"Phys. Rep."},{"key":"2020121116434386400_B8","article-title":"mclust version 4 for R: Normal mixture modeling for model-based clustering, classification, and density estimation","author":"Fraley,","year":"2012","journal-title":"Technical report"},{"key":"2020121116434386400_B9","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan,","year":"2002","journal-title":"Proc. Nat. Acad. Sci."},{"key":"2020121116434386400_B10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1561\/2200000005","article-title":"A survey of statistical network models","volume":"2","author":"Goldenberg,","year":"2010","journal-title":"Found. Trends Mach. Learn."},{"key":"2020121116434386400_B11","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":"J. Am. Statist. Assoc."},{"key":"2020121116434386400_B12","article-title":"A central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference","author":"Levin,","year":"2019"},{"key":"2020121116434386400_B13","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 Trans. Inf. Theory"},{"key":"2020121116434386400_B14","volume":"60","author":"Lov\u00e1sz,","year":"2012","journal-title":"Large Networks and Graph Limits"},{"key":"2020121116434386400_B15","article-title":"On consistent vertex nomination schemes","author":"Lyzinski,","year":"2018"},{"key":"2020121116434386400_B16","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":"Electron. J. Statist."},{"key":"2020121116434386400_B17","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 Trans. Network Sci. Eng."},{"key":"2020121116434386400_B18","article-title":"Semiparametric spectral modeling of the Drosophila connectome","author":"Priebe,","year":"2017"},{"key":"2020121116434386400_B19","year":"2020","journal-title":"R: A Language and Environment for Statistical Computing"},{"key":"2020121116434386400_B20","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","article-title":"Objective criteria for the evaluation of clustering methods","volume":"66","author":"Rand,","year":"1971","journal-title":"J. Am. Statist. Assoc."},{"key":"2020121116434386400_B21","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":"Ann. Statist."},{"key":"2020121116434386400_B22","first-page":"2810","article-title":"Bayesian Poisson Tucker decomposition for learning the structure of international relations","volume":"48","author":"Schein,","year":"2016","journal-title":"Proc. Mach. Learn. Res."},{"key":"2020121116434386400_B23","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":"J. Am. Statist. Assoc."},{"key":"2020121116434386400_B24","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TPAMI.2013.135","article-title":"Consistent latent position estimation and vertex classification for random dot product graphs","volume":"36","author":"Sussman,","year":"2014","journal-title":"IEEE Trans. Pat. Anal. Mach. Intel."},{"key":"2020121116434386400_B25","doi-asserted-by":"crossref","first-page":"1599","DOI":"10.3150\/15-BEJ789","article-title":"A nonparametric two-sample hypothesis testing problem for random graphs","volume":"23","author":"Tang,","year":"2017","journal-title":"Bernoulli"},{"key":"2020121116434386400_B26","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":"Ann. Statist."},{"key":"2020121116434386400_B27","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1214\/13-AOS1112","article-title":"Universally consistent vertex classification for latent positions graphs","volume":"41","author":"Tang,","year":"2013","journal-title":"Ann. Statist."},{"key":"2020121116434386400_B28","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1109\/TMI.2018.2885968","article-title":"Connectome smoothing via low-rank approximations","volume":"38","author":"Tang,","year":"2018","journal-title":"IEEE Trans. Med. Imag."},{"key":"2020121116434386400_B29","article-title":"Robust estimation from multiple graphs under gross error contamination","author":"Tang,","year":"2017"},{"key":"2020121116434386400_B30","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1214\/17-BA1078","article-title":"Bayesian community detection","volume":"13","author":"van der Pas,","year":"2018","journal-title":"Bayesian Anal."},{"key":"2020121116434386400_B31","doi-asserted-by":"crossref","DOI":"10.1109\/TPAMI.2019.2948619","article-title":"Joint embedding of graphs","author":"Wang,","year":"2019"},{"key":"2020121116434386400_B32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77004-6_11","article-title":"Random dot product graph models for social networks","author":"Young,","year":"2007","journal-title":"Proc. Int. Workshop on Algorithms and Models for the Web-Graph"},{"key":"2020121116434386400_B33","doi-asserted-by":"crossref","first-page":"2266","DOI":"10.1214\/12-AOS1036","article-title":"Consistency of community detection in networks under degree-corrected stochastic block models","volume":"40","author":"Zhao,","year":"2012","journal-title":"Ann. Statist."},{"key":"2020121116434386400_B34","article-title":"Mixing time of Metropolis\u2013Hastings for Bayesian community detection","author":"Zhuo,","year":"2018"}],"container-title":["Biometrika"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/biomet\/article-pdf\/107\/4\/875\/34865852\/asaa031.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/biomet\/article-pdf\/107\/4\/875\/34865852\/asaa031.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T07:42:11Z","timestamp":1607758931000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/biomet\/article\/107\/4\/875\/5867841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":34,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,7,6]]},"published-print":{"date-parts":[[2020,12,1]]}},"URL":"https:\/\/doi.org\/10.1093\/biomet\/asaa031","relation":{},"ISSN":["0006-3444","1464-3510"],"issn-type":[{"value":"0006-3444","type":"print"},{"value":"1464-3510","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2020,12]]},"published":{"date-parts":[[2020,7,6]]}}}