Related papers: Limit theorems for sequences of random trees
In graph theory, a tree is one of the more popular families of graphs with a wide range of applications in computer science as well as many other related fields. While there are several distance measures over the set of all trees, we…
Random forests are ensemble methods which grow trees as base learners and combine their predictions by averaging. Random forests are known for their good practical performance, particularly in high dimensional set-tings. On the theoretical…
We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
In this paper, on the sublinear expectation space, we establish a comparison theorem between independent and convolutionary random vectors, which states that the partial sums of those two sequences of random vectors are identically…
We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…
The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…
This paper concerns a method of testing equality of distribution of random convex compact sets and the way how to use the test to distinguish between two realisations of general random sets. The family of metrics on the space of…
We study some sufficient conditions imposed on the sequence of martingale differences (m.d.) in the separable Banach spaces of continuous functions defined on the metric compact set for the Central Limit Theorem in this space. We taking…
This 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…
A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…
Let $(X_i)_{i \geq 1}$ and $(Y_i)_{i\geq1}$ be two independent sequences of independent identically distributed random variables taking their values in a common finite alphabet and having the same law. Let $LC_n$ be the length of the…
Let $T$ be a random tree taken uniformly at random from the family of labelled trees on $n$ vertices. In this note, we provide bounds for $c(n)$, the number of sub-trees of $T$ that hold asymptotically almost surely. With computer support…
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…
In this work, we introduce a random field in view of natural image modeling, obtained as a limit of sequences of dead leaves models, when considering arbitrarily small or big objects. The dead leaves model, introduced by the Mathematical…
The central limit theorem, the invariance principle and the Poisson limit theorem for the hierarchy of freeness are studied. We show that for given natural m the limit laws can be expressed in terms of non-crossing partitions of depth…
Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…
In order to conduct a statistical analysis on a given set of phylogenetic gene trees, we often use a distance measure between two trees. In a statistical distance-based method to analyze discordance between gene trees, it is a key to decide…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…
For $1\le p \le \infty$, the Fr\'echet $p$-mean of a probability measure on a metric space is an important notion of central tendency that generalizes the usual notions in the real line of mean ($p=2$) and median ($p=1$). In this work we…