Abstract We study the fringe of random recursive trees, by analyzing the joint distribution of the counts of uncorrelated motifs. Our approach allows for finite and countably infinite collections. To be able to deal with the collection when it is infinitely countable, we use measure-theoretic themes. Each member of a collection of motifs occurs a certain number of times on the fringe. We show that these numbers, under appropriate normalization, have a limiting joint multivariate normal distribution. We give a complete characterization of the asymptotic covariance matrix. The methods of proof include contraction in a metric space of distribution functions to a fixed-point solution (limit distribution). We discuss two examples: the finite col...
ABSTRACT. We show that an algorithmic construction of sequences of recursive trees leads to a direct...
Abstract. We consider conditioned Galton–Watson trees and show as-ymptotic normality of additive fun...
Let~$T_n$ denote the set of unrooted labeled trees of size~$n$ and let~$T_n$ be a particular (finite...
In this dissertation we study three problems related to motifs and recursive trees. In the first pro...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
Abstract. Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finit...
We give general theorems on asymptotic normality for additive functionals of random tries generated ...
We give theorems about asymptotic normality of general additive functionals on patricia tries, deriv...
AbstractWe study the joint probability distribution of the number of nodes of fan-out k in random re...
We introduce a general recursive method to construct continuum random trees (CRTs) from independent ...
Random recursive trees are classic models of random trees. A random recursive tree is initiated with...
This survey studies asymptotics of random fringe trees and extended fringe trees in random trees tha...
We summarize several limit results for the profile of random plane-oriented recursive trees. These i...
It is proved that the distribution of the number of endpoints in a random recursive tree of order n ...
ABSTRACT. We show that an algorithmic construction of sequences of recursive trees leads to a direct...
Abstract. We consider conditioned Galton–Watson trees and show as-ymptotic normality of additive fun...
Let~$T_n$ denote the set of unrooted labeled trees of size~$n$ and let~$T_n$ be a particular (finite...
In this dissertation we study three problems related to motifs and recursive trees. In the first pro...
We prove general limit theorems for sums of functions of subtrees of (random) binary search trees an...
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursiv...
Abstract. Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finit...
We give general theorems on asymptotic normality for additive functionals of random tries generated ...
We give theorems about asymptotic normality of general additive functionals on patricia tries, deriv...
AbstractWe study the joint probability distribution of the number of nodes of fan-out k in random re...
We introduce a general recursive method to construct continuum random trees (CRTs) from independent ...
Random recursive trees are classic models of random trees. A random recursive tree is initiated with...
This survey studies asymptotics of random fringe trees and extended fringe trees in random trees tha...
We summarize several limit results for the profile of random plane-oriented recursive trees. These i...
It is proved that the distribution of the number of endpoints in a random recursive tree of order n ...
ABSTRACT. We show that an algorithmic construction of sequences of recursive trees leads to a direct...
Abstract. We consider conditioned Galton–Watson trees and show as-ymptotic normality of additive fun...
Let~$T_n$ denote the set of unrooted labeled trees of size~$n$ and let~$T_n$ be a particular (finite...