Inversions in Split Trees and Conditional Galton–Watson Trees

Related Items (5)

Scaling limits of discrete snakes with stable branching ⋮ \(k\)-cut on paths and some trees ⋮ Embedding small digraphs and permutations in binary trees and split trees ⋮ Асимптотические свойства числа инверсий в случайном лесе ⋮ Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey

Uses Software

DLMF
Quicksort

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Novel characteristics of split trees by use of renewal theory
The total path length of split trees
The continuum random tree. I
Some average measures in m-ary search trees
On the analysis of linear probing hashing
On the expected height of fringe-blanced trees
Quad trees: A data structure for retrieval by composite keys
A note on ``State spaces of the snake and its tour: convergence of the discrete snake by J.-F. Marckert and A. Mokkadem
A general limit theorem for recursive algorithms and combinatorial structures
Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
The center of mass of the ISE and the Wiener index of trees
The contraction method for recursive algorithms
On the analysis of stochastic divide and conquer algorithms
Limiting distributions for the number of inversions in labelled tree families
Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
Embedding small digraphs and permutations in binary trees and split trees
Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
The continuum random tree. III
Central and local limit theorems applied to asymptotic enumeration
On a multivariate contraction method for random recursive structures with applications to Quicksort
Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
Locally balanced binary trees
Analysis of the space of search trees under the random insertion algorithm
Universal Limit Laws for Depths in Random Trees
On the internal path length ofd-dimensional quad trees
The Wiener Index of simply generated random trees
m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
New results on the size of tries
Enumeration of trees by inversions
Probabilistic Methods in Combinatorial Analysis
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
File structures using hashing functions
The inversion enumerator for labeled trees
A limit theorem for “quicksort”
Probability: A Graduate Course
Probability
Quicksort

This page was built for publication: Inversions in Split Trees and Conditional Galton–Watson Trees