Inversions in split trees and conditional Galton-Watson trees
From MaRDI portal
Publication:5222541
Recommendations
- Inversions in split trees and conditional Galton-Watson trees
- Limiting distributions for the number of inversions in labelled tree families
- Permutations in binary trees and split trees
- Asymptotic properties of the number of inversions in a random forest
- Embedding small digraphs and permutations in binary trees and split trees
Cites work
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 1033192 (Why is no real title available?)
- scientific article; zbMATH DE number 2000846 (Why is no real title available?)
- scientific article; zbMATH DE number 3233336 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
- A general limit theorem for recursive algorithms and combinatorial structures
- A limit theorem for “quicksort”
- A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
- A note on ``State spaces of the snake and its tour: convergence of the discrete snake by J.-F. Marckert and A. Mokkadem
- A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
- Analysis of the space of search trees under the random insertion algorithm
- Central and local limit theorems applied to asymptotic enumeration
- Digital trees and memoryless sources: from arithmetics to analysis
- Embedding small digraphs and permutations in binary trees and split trees
- Enumeration of trees by inversions
- File structures using hashing functions
- Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
- Limiting distributions for the number of inversions in labelled tree families
- Locally balanced binary trees
- New results on the size of tries
- Novel characteristics of split trees by use of renewal theory
- On a multivariate contraction method for random recursive structures with applications to quicksort
- On the analysis of linear probing hashing
- On the analysis of stochastic divide and conquer algorithms
- On the expected height of fringe-blanced trees
- On the internal path length ofd-dimensional quad trees
- Permutations with inversions
- Probabilistic Methods in Combinatorial Analysis
- Probability. Theory and examples.
- Probability: a graduate course
- Quad trees: A data structure for retrieval by composite keys
- Quicksort
- Random recursive trees and preferential attachment trees are random split trees
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation (extended abstract)
- Some average measures in m-ary search trees
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
- The Wiener Index of simply generated random trees
- The center of mass of the ISE and the Wiener index of trees
- The continuum random tree. I
- The continuum random tree. III
- The contraction method for recursive algorithms
- The inversion enumerator for labeled trees
- The total path length of split trees
- Universal Limit Laws for Depths in Random Trees
Cited in
(11)- Permutations in binary trees and split trees
- On edge-weighted recursive trees and inversions in random permutations
- Inference for conditioned Galton-Watson trees from their Harris path
- Asymptotic properties of the number of inversions in a random forest
- Scaling limits of discrete snakes with stable branching
- Asymptotic properties of the inversion number in colored trees
- Inversions in split trees and conditional Galton-Watson trees
- Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
- Embedding small digraphs and permutations in binary trees and split trees
- \(k\)-cut on paths and some trees
- Limiting distributions for the number of inversions in labelled tree families
This page was built for publication: Inversions in split trees and conditional Galton-Watson trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222541)