International audienceThis extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local sense. Moderate as well as large deviations estimates are also derived. The proofs rely on the analysis (in the complex plane) of generating functions associated with trees of bounded height
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
Abstract. We consider the number of nodes in the levels of unlabeled rooted random trees and show th...
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted bin...
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted bin...
International audienceThis study is dedicated to precise distributional analyses of the height of no...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
AbstractWe consider the number of nodes in the levels of unlabelled rooted random trees and show tha...
AbstractDenote by Sn the set of all distinct rooted binary trees with n unlabeled vertices. Define σ...
We introduce weights on the unrooted unlabelled plane trees as follows: for each p ≥ 1, let μp be a ...
AbstractThe average height of a binary tree with n internal nodes is shown to be asymptotic to 2√πn....
AbstractWe study the height of the binary search tree—the most fundamental data structure used for s...
Let~$T_n$ denote the set of unrooted labeled trees of size~$n$ and let~$T_n$ be a particular (finite...
AbstractWe investigate the profile of random Pólya trees of size n when only nodes of degree d are c...
We establish lower tail bounds for the height, and upper tail bounds for the width, of critical size...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
Abstract. We consider the number of nodes in the levels of unlabeled rooted random trees and show th...
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted bin...
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted bin...
International audienceThis study is dedicated to precise distributional analyses of the height of no...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
AbstractWe consider the number of nodes in the levels of unlabelled rooted random trees and show tha...
AbstractDenote by Sn the set of all distinct rooted binary trees with n unlabeled vertices. Define σ...
We introduce weights on the unrooted unlabelled plane trees as follows: for each p ≥ 1, let μp be a ...
AbstractThe average height of a binary tree with n internal nodes is shown to be asymptotic to 2√πn....
AbstractWe study the height of the binary search tree—the most fundamental data structure used for s...
Let~$T_n$ denote the set of unrooted labeled trees of size~$n$ and let~$T_n$ be a particular (finite...
AbstractWe investigate the profile of random Pólya trees of size n when only nodes of degree d are c...
We establish lower tail bounds for the height, and upper tail bounds for the width, of critical size...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
A widely used class of binary trees is studied in order to provide information useful in evaluating ...
Abstract. We consider the number of nodes in the levels of unlabeled rooted random trees and show th...