AbstractAdditive tree functionals represent the cost of many divide-and-conquer algorithms. We derive the limiting distribution of the additive functionals induced by toll functions of the form (a) nα when α>0 and (b) logn (the so-called shape functional) on uniformly distributed binary trees, sometimes called Catalan trees. The Gaussian law obtained in the latter case complements the central limit theorem for the shape functional under the random permutation model. Our results give rise to an apparently new family of distributions containing the Airy distribution (α=1) and the normal distribution [case (b), and case (a) as α↓0]. The main theoretical tools employed are recent results relating asymptotics of the generating functions of seque...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
The aim of this thesis is the study of approximations and rates of convergence for functionals of la...
We study the additive functional X-n(alpha) on conditioned Galton-Watson trees given, for arbitrary ...
Many parameters of trees are additive in the sense that they can be computed recursively from the su...
Using recent results on singularity analysis for Hadamard products of generating functions, we obtai...
This thesis studies the limit distribution of parameters recursively defined on trees (rooted graphs...
The delight of finding unexpected connections is one of the rewards of studying mathematics. In this...
We give general theorems on asymptotic normality for additive functionals of random tries generated ...
L'objectif de cette thèse est l'étude des approximations et des vitesses de convergence pour des fon...
International audienceAn and/or tree is a binary plane tree, with internal nodes labelled by connect...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
Abstract. We consider conditioned Galton–Watson trees and show as-ymptotic normality of additive fun...
We give theorems about asymptotic normality of general additive functionals on patricia tries, deriv...
We define a probability distribution over the set of Boolean functions of k variables induced by the...
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...
The aim of this thesis is the study of approximations and rates of convergence for functionals of la...
We study the additive functional X-n(alpha) on conditioned Galton-Watson trees given, for arbitrary ...
Many parameters of trees are additive in the sense that they can be computed recursively from the su...
Using recent results on singularity analysis for Hadamard products of generating functions, we obtai...
This thesis studies the limit distribution of parameters recursively defined on trees (rooted graphs...
The delight of finding unexpected connections is one of the rewards of studying mathematics. In this...
We give general theorems on asymptotic normality for additive functionals of random tries generated ...
L'objectif de cette thèse est l'étude des approximations et des vitesses de convergence pour des fon...
International audienceAn and/or tree is a binary plane tree, with internal nodes labelled by connect...
The number of binary trees of fixed size and given height is estimated asymptotically near the peak ...
Abstract. We consider conditioned Galton–Watson trees and show as-ymptotic normality of additive fun...
We give theorems about asymptotic normality of general additive functionals on patricia tries, deriv...
We define a probability distribution over the set of Boolean functions of k variables induced by the...
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...
The aim of this thesis is the study of approximations and rates of convergence for functionals of la...
We study the additive functional X-n(alpha) on conditioned Galton-Watson trees given, for arbitrary ...