International audienceThis study is dedicated to precise distributional analyses of the height of non-plane unlabelled binary trees ("Otter trees"), when trees of a given size are taken with equal likelihood. The height of a rooted tree of size $n$ is proved to admit a limiting theta distribution, both in a central and local sense, as well as obey moderate as well as large deviations estimates. The approximations obtained for height also yield the limiting distribution of the diameter of unrooted trees. The proofs rely on a precise analysis, in the complex plane and near singularities, of generating functions associated with trees of bounded height
We consider extended binary trees and study the common right and left depth of leaf $j$, where the l...
The limiting distribution of the size of binary interval tree is investigated. Our illustration is b...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties o...
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...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
AbstractDenote by Sn the set of all distinct rooted binary trees with n unlabeled vertices. Define σ...
We consider the diameter of Lévy trees that are random compact metric spaces obtained as the ...
International audienceLet $\mathcal{T}_n$ denote the set of unrooted unlabeled trees of size $n$ and...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
International audienceBy computations on generating functions, Szekeres proved in 1983 that the law ...
Abstract. In this survey we present results and the used proof techniques concerning the analysis of...
AbstractWe study the height of the binary search tree—the most fundamental data structure used for s...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
Abstract. Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finit...
We consider extended binary trees and study the common right and left depth of leaf $j$, where the l...
The limiting distribution of the size of binary interval tree is investigated. Our illustration is b...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties o...
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...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
AbstractDenote by Sn the set of all distinct rooted binary trees with n unlabeled vertices. Define σ...
We consider the diameter of Lévy trees that are random compact metric spaces obtained as the ...
International audienceLet $\mathcal{T}_n$ denote the set of unrooted unlabeled trees of size $n$ and...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
International audienceBy computations on generating functions, Szekeres proved in 1983 that the law ...
Abstract. In this survey we present results and the used proof techniques concerning the analysis of...
AbstractWe study the height of the binary search tree—the most fundamental data structure used for s...
AbstractWe study the quantity distance between node j and node n in a random tree of size n chosen f...
Abstract. Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finit...
We consider extended binary trees and study the common right and left depth of leaf $j$, where the l...
The limiting distribution of the size of binary interval tree is investigated. Our illustration is b...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties o...