The limiting distribution of the size of binary interval tree is investigated. Our illustration is based on the contraction method, and it is quite different from the case in one-sided binary interval tree. First, we build a distributional recursive equation of the size. Then, we draw the expectation, the variance, and some high order moments. Finally, it is shown that the size (with suitable standardization) approaches the standard normal random variable in the Zolotarev metric space
AbstractWe consider distributional recursions which appear in the study of random binary search tree...
Billey-Konvalinka-Swanson studied the asymptotic distribution of the coefficients of Stanley's \(q\)...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
International audienceThis study is dedicated to precise distributional analyses of the height of no...
The average-case analysis of algorithms for binary search trees yields very different results from t...
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted bin...
Abstract. We prove lower bounds on the expected size of the maximum agreement subtree of two random ...
International audienceLet $\mathcal{T}_n$ denote the set of unrooted unlabeled trees of size $n$ and...
Devroye (SIAM J. Comput. 28 (1999) 1215-1224) computed the average size of several random hash-based...
AbstractWe study the height of the binary search tree—the most fundamental data structure used for s...
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted bin...
Abstract. In this survey we present results and the used proof techniques concerning the analysis of...
In phylogenetic analysis it is useful to study the distribution of parsimony length of a tree, under...
AbstractWe introduce the m-ary interval tree, a random structure that underlies interval division an...
AbstractWe consider distributional recursions which appear in the study of random binary search tree...
Billey-Konvalinka-Swanson studied the asymptotic distribution of the coefficients of Stanley's \(q\)...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
International audienceThis study is dedicated to precise distributional analyses of the height of no...
The average-case analysis of algorithms for binary search trees yields very different results from t...
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted bin...
Abstract. We prove lower bounds on the expected size of the maximum agreement subtree of two random ...
International audienceLet $\mathcal{T}_n$ denote the set of unrooted unlabeled trees of size $n$ and...
Devroye (SIAM J. Comput. 28 (1999) 1215-1224) computed the average size of several random hash-based...
AbstractWe study the height of the binary search tree—the most fundamental data structure used for s...
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted bin...
Abstract. In this survey we present results and the used proof techniques concerning the analysis of...
In phylogenetic analysis it is useful to study the distribution of parsimony length of a tree, under...
AbstractWe introduce the m-ary interval tree, a random structure that underlies interval division an...
AbstractWe consider distributional recursions which appear in the study of random binary search tree...
Billey-Konvalinka-Swanson studied the asymptotic distribution of the coefficients of Stanley's \(q\)...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...