{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:21:21Z","timestamp":1765369281354},"reference-count":31,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T00:00:00Z","timestamp":1526860800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree and the standard preferential attachment tree. An application is given to the sum over all pairs of nodes of the common number of ancestors.<\/jats:p>","DOI":"10.1017\/s0963548318000226","type":"journal-article","created":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T09:27:33Z","timestamp":1526894853000},"page":"81-99","source":"Crossref","is-referenced-by-count":14,"title":["Random Recursive Trees and Preferential Attachment Trees are Random Split Trees"],"prefix":"10.1017","volume":"28","author":[{"given":"SVANTE","family":"JANSON","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2018,5,21]]},"reference":[{"key":"S0963548318000226_ref6","doi-asserted-by":"publisher","DOI":"10.2307\/1426138"},{"key":"S0963548318000226_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55251-0_2"},{"key":"S0963548318000226_ref29","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240050207"},{"key":"S0963548318000226_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-211-75357-6"},{"key":"S0963548318000226_ref15","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v17-1723"},{"key":"S0963548318000226_ref2","first-page":"31","article-title":"On a characteristic property of Polya's urn","volume":"4","author":"Athreya","year":"1969","journal-title":"Studia Sci. Math. Hungar."},{"key":"S0963548318000226_ref10","doi-asserted-by":"publisher","DOI":"10.1214\/11-AAP812"},{"key":"S0963548318000226_ref20","volume-title":"Urn Models and Their Application: An Approach to Modern Discrete Probability Theory","author":"Johnson","year":"1977"},{"key":"S0963548318000226_ref3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"S0963548318000226_ref24","first-page":"177","article-title":"Sur quelques formules limites du calcul des probabilit\u00e9s (Russian)","volume":"11","author":"Markov","year":"1917","journal-title":"Bulletin de l'Acad\u00e9mie Imp\u00e9riale des Sciences, Petrograd"},{"key":"S0963548318000226_ref7","doi-asserted-by":"publisher","DOI":"10.2307\/3213469"},{"key":"S0963548318000226_ref27","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20161"},{"key":"S0963548318000226_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-0112-x"},{"key":"S0963548318000226_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0099421"},{"key":"S0963548318000226_ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548302005321"},{"key":"S0963548318000226_ref26","volume-title":"NIST Handbook of Mathematical Functions","author":"Olver","year":"2010"},{"key":"S0963548318000226_ref22","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-18.2.374"},{"key":"S0963548318000226_ref28","unstructured":"Pitman J. (2006) Combinatorial Stochastic Processes, \u00c9cole d'\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XXXII, 2002, Vol. 1875 of Lecture Notes in Mathematics, Springer."},{"key":"S0963548318000226_ref17","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10074"},{"key":"S0963548318000226_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4149(82)90011-4"},{"key":"S0963548318000226_ref31","first-page":"297","article-title":"On a nonuniform random recursive tree","volume":"33","author":"Szyma\u0144ski","year":"1987","journal-title":"Ann. Discrete Math."},{"key":"S0963548318000226_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4015-8"},{"key":"S0963548318000226_ref19","doi-asserted-by":"crossref","first-page":"292","DOI":"10.21136\/CMJ.1958.100304","article-title":"Stochastic branching processes with continuous state space","volume":"8","author":"Ji\u0159ina","year":"1958","journal-title":"Czechoslovak Math. J."},{"key":"S0963548318000226_ref9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20202"},{"key":"S0963548318000226_ref30","first-page":"117","article-title":"Sur quelques points de la th\u00e9orie des probabilit\u00e9s","volume":"1","author":"P\u00f3lya","year":"1930","journal-title":"Ann. Inst. Poincar\u00e9"},{"key":"S0963548318000226_ref14","unstructured":"Hoeffding W. (1961) The strong law of large numbers for U-statistics. Institute of Statistics, University of North Carolina, Mimeograph series 302. https:\/\/repository.lib.ncsu.edu\/handle\/1840.4\/2128"},{"key":"S0963548318000226_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511617768"},{"key":"S0963548318000226_ref13","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19230030407"},{"key":"S0963548318000226_ref16","doi-asserted-by":"publisher","DOI":"10.1214\/16-PS272"},{"key":"S0963548318000226_ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795283954"},{"key":"S0963548318000226_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.spa.2003.12.002"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548318000226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T05:59:02Z","timestamp":1604296742000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548318000226\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,21]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["S0963548318000226"],"URL":"https:\/\/doi.org\/10.1017\/s0963548318000226","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,21]]}}}