Sökning: id:"swepub:oai:DiVA.org:uu-406712" >
Embedding Small Dig...
Embedding Small Digraphs and Permutations in Binary Trees and Split Trees
-
- Albert, Michael (författare)
- Univ Otago, Dept Comp Sci, Dunedin, New Zealand
-
- Holmgren, Cecilia, 1984- (författare)
- Uppsala universitet,Analys och sannolikhetsteori
-
- Johansson, Tony (författare)
- Stockholms universitet,Matematiska institutionen,Stockholm Univ, Dept Math, Stockholm, Sweden
-
visa fler...
-
- Skerman, Fiona (författare)
- Masaryk Univ, Fac Informat, Brno, Czech Republic
-
visa färre...
-
(creator_code:org_t)
- 2020-01-07
- 2020
- Engelska.
-
Ingår i: Algorithmica. - : SPRINGER. - 0178-4617 .- 1432-0541. ; 82:3, s. 589-615
- Relaterad länk:
-
https://doi.org/10.1...
-
visa fler...
-
https://uu.diva-port... (primary) (Raw object)
-
https://link.springe...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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 (Cai et al. in Combin Probab Comput 28(3):335-364, 2019). We consider complete binary trees as well as random split trees a large class of random trees of logarithmic height introduced by Devroye (SIAM J Comput 28(2):409-432, 1998. 10.1137/s0097539795283954). 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.
Ämnesord
- NATURVETENSKAP -- Matematik -- Sannolikhetsteori och statistik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Probability Theory and Statistics (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Nyckelord
- Random trees
- Split trees
- Permutations
- Inversions
- Cumulants
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas