{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T05:00:22Z","timestamp":1745730022735,"version":"3.37.3"},"reference-count":58,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/100000185","name":"Air Force Research Laboratory and DARPA","doi-asserted-by":"publisher","award":["FA8750-18-2-0035"],"award-info":[{"award-number":["FA8750-18-2-0035"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Graphical Statistics"],"published-print":{"date-parts":[[2021,10,2]]},"DOI":"10.1080\/10618600.2021.1872582","type":"journal-article","created":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T21:13:01Z","timestamp":1611090781000},"page":"1111-1123","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":4,"title":["Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks"],"prefix":"10.1080","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3071-9043","authenticated-orcid":false,"given":"Jes\u00fas","family":"Arroyo","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Maryland, College Park, MD;"},{"name":"Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD;"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8307-2610","authenticated-orcid":false,"given":"Daniel L.","family":"Sussman","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Boston University, Boston, MA"}]},{"given":"Carey E.","family":"Priebe","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Statistics, Johns Hopkins University, Baltimore, MD;"}]},{"given":"Vince","family":"Lyzinski","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Maryland, College Park, MD;"}]}],"member":"301","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2005.01.007"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_2_4_1","doi-asserted-by":"crossref","unstructured":"Babai L. (2015) \u201cGraph Isomorphism in Quasipolynomial Time \u201d arXiv no. 1512.03547.","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_3_2_5_1","first-page":"9190","article-title":"\u201c(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs","author":"Barak B.","year":"2019","unstructured":"Barak, B., Chou, C.-N., Lei, Z., Schramm, T., and Sheng, Y. (2019), \u201c(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs,\u201d in Advances in Neural Information Processing Systems, pp. 9190\u20139198.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0907096106"},{"key":"e_1_3_2_7_1","volume-title":"Mathematical Statistics: Basic Ideas and Selected Topics, Volume I","author":"Bickel P. J.","year":"2015","unstructured":"Bickel, P. J., and Doksum, K. A. (2015), Mathematical Statistics: Basic Ideas and Selected Topics, Volume I (Vol. 117), Boca Raton, FL: CRC Press."},{"key":"e_1_3_2_8_1","unstructured":"Chang J. Kolaczyk E. D. and Yao Q. (2018) \u201cEstimation of Subgraph Density in Noisy Networks \u201d arXiv no. 1803.02488."},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/aama.2001.0720"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"e_1_3_2_11_1","first-page":"1","article-title":"\u201cThe igraph Software Package for Complex Network Research","volume":"1695","author":"Csardi G.","year":"2006","unstructured":"Csardi, G., and Nepusz, T. (2006), \u201cThe igraph Software Package for Complex Network Research,\u201d InterJournal, Complex Systems, 1695, 1\u20139.","journal-title":"InterJournal, Complex Systems"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901460"},{"key":"e_1_3_2_13_1","unstructured":"Cullina D. and Kiyavash N. (2017) \u201cExact Alignment Recovery for Correlated Erd\u0151s-R\u00e9nyi Graphs \u201d arXiv no. 1711.06783."},{"key":"e_1_3_2_14_1","unstructured":"Ding J. Ma Z. Wu Y. and Xu J. (2018) \u201cEfficient Random Graph Matching via Degree Profiles \u201d arXiv no. 1811.07821."},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01895716"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2019.05.008"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/120875600"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001414500013"},{"key":"e_1_3_2_20_1","unstructured":"Franke B. and Wolfe P. J. (2016) \u201cNetwork Modularity in the Presence of Covariates \u201d arXiv no. 1603.01214."},{"key":"e_1_3_2_21_1","unstructured":"Grave E. Joulin A. and Berthet Q. (2018) \u201cUnsupervised Alignment of Embeddings With Wasserstein Procrustes \u201d arXiv no. 1805.11222."},{"key":"e_1_3_2_22_1","doi-asserted-by":"crossref","unstructured":"Heimann M. Shen H. Safavi T. and Koutra D. (2018) \u201cRegal: Representation Learning-Based Graph Alignment \u201d in Proceedings of the 27th ACM International Conference on Information and Knowledge Management ACM pp. 117\u2013126.","DOI":"10.1145\/3269206.3271788"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20008"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10054"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732274"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-4076(99)00044-5"},{"key":"e_1_3_2_27_1","first-page":"10890","article-title":"Mcdiarmid-Type Inequalities for Graph-Dependent Variables and Stability Bounds","author":"Liu X.","year":"2019","unstructured":"Liu, X., Wang, Y., and Wang, L. (2019), \u201cMcdiarmid-Type Inequalities for Graph-Dependent Variables and Stability Bounds,\u201d in Advances in Neural Information Processing Systems, pp. 10890\u201310901.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.954602"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2808999"},{"key":"e_1_3_2_30_1","unstructured":"Lyzinski V. Adali S. Vogelstein J. T. Park Y. and Priebe C. E. (2014) \u201cSeeded Graph Matching via Joint Optimization of Fidelity and Commensurability \u201d arXiv no. 1401.3813."},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2424894"},{"key":"e_1_3_2_32_1","first-page":"3513","article-title":"\u201cSeeded Graph Matching for Correlated Erd\u00f6s-R\u00e9nyi Graphs,\u201d","volume":"15","author":"Lyzinski V.","year":"2014","unstructured":"Lyzinski, V., Fishkind, D., and Priebe, C. (2014), \u201cSeeded Graph Matching for Correlated Erd\u00f6s-R\u00e9nyi Graphs,\u201d Journal of Machine Learning Research, 15, 3513\u20133540.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_33_1","first-page":"1","article-title":"\u201cOn the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching,\u201d","volume":"17","author":"Lyzinski V.","year":"2016","unstructured":"Lyzinski, V., Levin, K., Fishkind, D., and Priebe, C. (2016), \u201cOn the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching,\u201d Journal of Machine Learning Research, 17, 1\u201334.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaz031"},{"key":"e_1_3_2_35_1","first-page":"1005","volume-title":"SIAM","author":"Mossel E.","year":"2019","unstructured":"Mossel, E., and Xu, J. (2019), \u201cSeeded Graph Matching via Large Neighborhood Statistics,\u201d in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, pp. 1005\u20131014."},{"key":"e_1_3_2_36_1","first-page":"173","volume-title":"IEEE","author":"Narayanan A.","year":"2009","unstructured":"Narayanan, A., and Shmatikov, V. (2009), \u201cDe-Anonymizing Social Networks,\u201d in 2009 30th IEEE Symposium on Security and Privacy, IEEE, pp. 173\u2013187."},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"key":"e_1_3_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0375-9601(99)00757-4"},{"key":"e_1_3_2_39_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914288"},{"key":"e_1_3_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SARNOF.2016.7846734"},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020596"},{"key":"e_1_3_2_42_1","unstructured":"Qin T. and Rohe K. (2013) \u201cRegularized Spectral Clustering Under the Degree-Corrected Stochastic Blockmodel \u201d in Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_43_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS887"},{"key":"e_1_3_2_44_1","doi-asserted-by":"crossref","unstructured":"Shirani F. Garg S. and Erkip E. (2017) \u201cSeeded Graph Matching: Efficient Algorithms and Theoretical Guarantees \u201d arXiv no. 1711.10360.","DOI":"10.1109\/ACSSC.2017.8335178"},{"key":"e_1_3_2_45_1","doi-asserted-by":"publisher","DOI":"10.1214\/07-STS249"},{"key":"e_1_3_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.135"},{"key":"e_1_3_2_47_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0121002"},{"key":"e_1_3_2_48_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature750"},{"key":"e_1_3_2_49_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.207"},{"key":"e_1_3_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"e_1_3_2_52_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.0076"},{"key":"e_1_3_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2512938.2512952"},{"key":"e_1_3_2_54_1","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"e_1_3_2_55_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp196"},{"key":"e_1_3_2_56_1","doi-asserted-by":"crossref","unstructured":"Zhang S. and Tong H. (2016) \u201cFinal: Fast Attributed Network Alignment \u201d in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining ACM pp. 1345\u20131354.","DOI":"10.1145\/2939672.2939766"},{"key":"e_1_3_2_57_1","unstructured":"Zhang Y. (2018a) \u201cConsistent Polynomial-Time Unseeded Graph Matching for Lipschitz Graphons \u201d arXiv no. 1807.11027."},{"key":"e_1_3_2_58_1","unstructured":"Zhang Y. (2018b) \u201cUnseeded Low-Rank Graph Matching by Transform-Based Unsupervised Point Registration \u201d arXiv no. 1807.04680."},{"key":"e_1_3_2_59_1","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1036"}],"container-title":["Journal of Computational and Graphical Statistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10618600.2021.1872582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:11:46Z","timestamp":1720696306000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10618600.2021.1872582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,5]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,10,2]]}},"alternative-id":["10.1080\/10618600.2021.1872582"],"URL":"https:\/\/doi.org\/10.1080\/10618600.2021.1872582","relation":{},"ISSN":["1061-8600","1537-2715"],"issn-type":[{"type":"print","value":"1061-8600"},{"type":"electronic","value":"1537-2715"}],"subject":[],"published":{"date-parts":[[2021,3,5]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucgs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=ucgs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-10-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-24","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}