{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T11:27:21Z","timestamp":1774438041084,"version":"3.50.1"},"reference-count":33,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study the problem of finding the root vertex in large growing networks. We prove that it is possible to construct confidence sets of size independent of the number of vertices in the network that contain the root vertex with high probability in various models of random networks. The models include uniform random recursive dags and uniform Cooper-Frieze random graphs.<\/jats:p>","DOI":"10.1017\/s0963548323000184","type":"journal-article","created":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T07:30:10Z","timestamp":1686641410000},"page":"859-873","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":8,"title":["Archaeology of random recursive dags and Cooper-Frieze random networks"],"prefix":"10.1017","volume":"32","author":[{"given":"Simon","family":"Briend","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Calvillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Lugosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2023,6,13]]},"reference":[{"key":"S0963548323000184_ref6","volume-title":"Survivable Networks: Algorithms for Diverse Routing","author":"Bhandari","year":"1999"},{"key":"S0963548323000184_ref7","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"S0963548323000184_ref8","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21072"},{"key":"S0963548323000184_ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2016.2622923"},{"key":"S0963548323000184_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-211-75357-6"},{"key":"S0963548323000184_ref29","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240050207"},{"key":"S0963548323000184_ref15","unstructured":"[15] Crane, H. and Xu, M. (2021b), Root and community inference on the latent growth process of a network using noisy attachment models, arXiv preprint arXiv: 2107.00153."},{"key":"S0963548323000184_ref26","doi-asserted-by":"publisher","DOI":"10.1214\/19-EJP268"},{"key":"S0963548323000184_ref24","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20726"},{"key":"S0963548323000184_ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2015.2397592"},{"key":"S0963548323000184_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61680-2_57"},{"key":"S0963548323000184_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11512-009-0118-0"},{"key":"S0963548323000184_ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548312000260"},{"key":"S0963548323000184_ref4","doi-asserted-by":"publisher","DOI":"10.1214\/21-AAP1731"},{"key":"S0963548323000184_ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2016.2627502"},{"key":"S0963548323000184_ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158885"},{"key":"S0963548323000184_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11009-012-9312-9"},{"key":"S0963548323000184_ref22","doi-asserted-by":"publisher","DOI":"10.2307\/3212150"},{"key":"S0963548323000184_ref28","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1001119"},{"key":"S0963548323000184_ref31","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1455"},{"key":"S0963548323000184_ref2","doi-asserted-by":"publisher","DOI":"10.1214\/21-AAP1686"},{"key":"S0963548323000184_ref3","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"S0963548323000184_ref10","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20649"},{"key":"S0963548323000184_ref11","doi-asserted-by":"publisher","DOI":"10.3150\/16-BEJ831"},{"key":"S0963548323000184_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00265991"},{"key":"S0963548323000184_ref21","volume-title":"Introduction to Random Graphs","author":"Frieze","year":"2016"},{"key":"S0963548323000184_ref13","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10084"},{"key":"S0963548323000184_ref16","doi-asserted-by":"publisher","DOI":"10.5802\/jep.15"},{"key":"S0963548323000184_ref1","unstructured":"[1] D\u00edaz Cort, J. , Serna Iglesias, M. J. , Spirakis, P. G. , Tor\u00e1n Romero, J. and Tsukiji, T. . (1994) On the expected depth of boolean circuits. Technical report, Technical Report LSI-94-7-R, Universitat Politecnica de Catalunya, Dep. LSI."},{"key":"S0963548323000184_ref5","doi-asserted-by":"publisher","DOI":"10.1214\/23-EJP930"},{"key":"S0963548323000184_ref14","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12428"},{"key":"S0963548323000184_ref19","first-page":"75","article-title":"On the discovery of the seed in uniform attachment trees","author":"Devroye","year":"2019","journal-title":"Internet Math."},{"key":"S0963548323000184_ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0044-4"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548323000184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T10:58:12Z","timestamp":1696849092000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548323000184\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,13]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["S0963548323000184"],"URL":"https:\/\/doi.org\/10.1017\/s0963548323000184","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,13]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}