{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T22:28:03Z","timestamp":1747261683471,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T00:00:00Z","timestamp":1578355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T00:00:00Z","timestamp":1578355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a random permutation. It also generalises some recent results on the number of inversions in randomly labelled trees\u00a0(Cai et al. in Combin Probab Comput 28(3):335\u2013364, 2019). We consider complete binary trees as well as random split trees a large class of random trees of logarithmic height introduced by Devroye\u00a0(SIAM J Comput 28(2):409\u2013432, 1998.<jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"doi\" xlink:href=\"https:\/\/doi.org\/10.1137\/s0097539795283954\">10.1137\/s0097539795283954<\/jats:ext-link>). Split trees consist of nodes (bags) which can contain balls and are generated by a random trickle down process of balls through the nodes. For complete binary trees we show that asymptotically the cumulants of the number of occurrences of a fixed permutation in the random node labelling have explicit formulas. Our other main theorem is to show that for a random split tree, with probability tending to one as the number of balls increases, the cumulants of the number of occurrences are asymptotically an explicit parameter of the split tree. For the proof of the second theorem we show some results on the number of embeddings of digraphs into split trees which may be of independent interest.<\/jats:p>","DOI":"10.1007\/s00453-019-00667-5","type":"journal-article","created":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T09:02:47Z","timestamp":1580547767000},"page":"589-615","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Embedding Small Digraphs and Permutations in Binary Trees and Split Trees"],"prefix":"10.1007","volume":"82","author":[{"given":"Michael","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cecilia","family":"Holmgren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9264-3462","authenticated-orcid":false,"given":"Tony","family":"Johansson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fiona","family":"Skerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,7]]},"reference":[{"key":"667_CR1","unstructured":"Albert, M., Holmgren, C., Johansson, T., Skerman, F.: Permutations in binary trees and split trees. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 110. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"667_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejc.2018.10.004","volume":"77","author":"K Anders","year":"2019","unstructured":"Anders, K., Archer, K.: Rooted forests that avoid sets of permutations. Eur. J. Combin. 77, 1\u201316 (2019)","journal-title":"Eur. J. Combin."},{"issue":"3","key":"667_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1017\/S0963548318000512","volume":"28","author":"XS Cai","year":"2019","unstructured":"Cai, X.S., Holmgren, C., Janson, S., Johansson, T., Skerman, F.: Inversions in split trees and conditional Galton\u2013Watson trees. Combin. Probab. Comput. 28(3), 335\u2013364 (2019)","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"667_CR4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jcta.2000.3121","volume":"94","author":"C Chauve","year":"2001","unstructured":"Chauve, C., Dulucq, S., Rechnitzer, A.: Enumerating alternating trees. J. Combin. Theory Ser. A 94(1), 142\u2013151 (2001)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"667_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/s0097539795283954","volume":"28","author":"L Devroye","year":"1998","unstructured":"Devroye, L.: Universal limit laws for depths in random trees. SIAM J. Comput. 28(2), 409\u2013432 (1998). https:\/\/doi.org\/10.1137\/s0097539795283954","journal-title":"SIAM J. Comput."},{"issue":"1","key":"667_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/bf00288933","volume":"4","author":"R Finkel","year":"1974","unstructured":"Finkel, R., Bentley, J.: Quad trees a data structure for retrieval on composite keys. Acta Inf. 4(1), 1\u20139 (1974). https:\/\/doi.org\/10.1007\/bf00288933","journal-title":"Acta Inf."},{"issue":"4","key":"667_CR7","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/PL00009236","volume":"22","author":"P Flajolet","year":"1998","unstructured":"Flajolet, P., Poblete, P., Viola, A.: On the analysis of linear probing hashing. Algorithmica 22(4), 490\u2013515 (1998)","journal-title":"Algorithmica"},{"issue":"4","key":"667_CR8","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1002\/jgt.3190190402","volume":"19","author":"IM Gessel","year":"1995","unstructured":"Gessel, I.M., Sagan, B.E., Yeh, Y.N.: Enumeration of trees by inversions. J. Graph Theory 19(4), 435\u2013459 (1995)","journal-title":"J. Graph Theory"},{"issue":"1","key":"667_CR9","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/366622.366644","volume":"5","author":"C Hoare","year":"1962","unstructured":"Hoare, C.: Quicksort. Comput. J. 5(1), 10\u201316 (1962). https:\/\/doi.org\/10.1145\/366622.366644","journal-title":"Comput. J."},{"key":"667_CR10","doi-asserted-by":"publisher","unstructured":"Holmgren, C.: Novel characteristics of split trees by use of renewal theory. Electron. J. Probab. (2012). https:\/\/doi.org\/10.1214\/ejp.v17-1723","DOI":"10.1214\/ejp.v17-1723"},{"key":"667_CR11","volume-title":"Random Graphs","author":"S Janson","year":"2011","unstructured":"Janson, S., Luczak, T., Rucinski, A.: Random Graphs, vol. 45. Wiley, New York (2011)"},{"key":"667_CR12","unstructured":"Lackner, M.L., Panholzer, A.: Runs in labelled trees and mappings. arXiv preprint arXiv:1507.05484 (2015)"},{"issue":"1","key":"667_CR13","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1090\/S0002-9904-1968-11888-9","volume":"74","author":"C Mallows","year":"1968","unstructured":"Mallows, C., Riordan, J.: The inversion enumerator for labeled trees. Bull. Am. Math. Soc. 74(1), 92\u201394 (1968)","journal-title":"Bull. Am. Math. Soc."},{"issue":"4","key":"667_CR14","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/s00026-012-0164-3","volume":"16","author":"A Panholzer","year":"2012","unstructured":"Panholzer, A., Seitz, G.: Limiting distributions for the number of inversions in labelled tree families. Ann. Combin. 16(4), 847\u2013870 (2012)","journal-title":"Ann. Combin."},{"key":"667_CR15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1111\/j.2517-6161.1965.tb00602.x","volume":"27","author":"R Pyke","year":"1965","unstructured":"Pyke, R.: Spacings. J. R. Stat. Soc. Ser. B Methodol. 27, 395\u2013436 (1965)","journal-title":"J. R. Stat. Soc. Ser. B Methodol."},{"issue":"2\u20133","key":"667_CR16","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1006\/aama.2001.0754","volume":"27","author":"CH Yan","year":"2001","unstructured":"Yan, C.H.: Generalized parking functions, tree inversions, and multicolored graphs. Adv. Appl. Math. 27(2\u20133), 641\u2013670 (2001)","journal-title":"Adv. Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00667-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00667-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00667-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T22:34:07Z","timestamp":1722378847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00667-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,7]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["667"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00667-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2020,1,7]]},"assertion":[{"value":"10 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}