We derive asymptotic approximations to the correlation coefficients of two level sizes in random recursive trees and binary search trees, which undergo sharp sign-changes when one level is fixed and the other one is varying. An asymptotic estimate for the expected width is also derived.
AbstractWe derive exact moments of the number of 2-protected nodes in binary search trees grown from...
Abstract. We study depth properties of a general class of random recursive trees where each node i a...
. The number of descendants of a node in a binary search tree (BST) is the size of the subtree havin...
[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Ga...
We summarize several limit results for the profile of random plane-oriented recursive trees. These i...
Abstract. For random trees T generated by the binary search tree algorithm from uniformly distribute...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
This paper studies path lengths in random binary search trees under the random permutation model. It...
We consider branching random walks with binary search trees as underlying trees. We show that the oc...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties o...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
Abstract. In this survey we present results and the used proof techniques concerning the analysis of...
International audienceIn this paper we present a study on the Random Forest (RF) family of classific...
AbstractWe derive exact moments of the number of 2-protected nodes in binary search trees grown from...
Abstract. We study depth properties of a general class of random recursive trees where each node i a...
. The number of descendants of a node in a binary search tree (BST) is the size of the subtree havin...
[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Ga...
We summarize several limit results for the profile of random plane-oriented recursive trees. These i...
Abstract. For random trees T generated by the binary search tree algorithm from uniformly distribute...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
This paper studies path lengths in random binary search trees under the random permutation model. It...
We consider branching random walks with binary search trees as underlying trees. We show that the oc...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties o...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
Abstract. In this survey we present results and the used proof techniques concerning the analysis of...
International audienceIn this paper we present a study on the Random Forest (RF) family of classific...
AbstractWe derive exact moments of the number of 2-protected nodes in binary search trees grown from...
Abstract. We study depth properties of a general class of random recursive trees where each node i a...
. The number of descendants of a node in a binary search tree (BST) is the size of the subtree havin...