Related papers: Algebraic two-level measure trees
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
We introduce an infinitesimal Hopf algebra of planar trees, generalising the construction of the non-commutative Connes-Kreimer Hopf algebra. A non-degenerate pairing and a dual basis are defined, and a combinatorial interpretation of the…
We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant…
We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…
The concept of trustworthy AI has gained widespread attention lately. One of the aspects relevant to trustworthy AI is robustness of ML models. In this study, we show how to probabilistically quantify robustness against naturally occurring…
This work is the first step towards a description of the Gromov boundary of the free factor graph of a free product, with applications to subgroup classification for outer automorphisms. We extend the theory of algebraic laminations dual to…
A treap is a classic randomized binary search tree data structure that is easy to implement and supports O(\log n) expected time access. However, classic treaps do not take advantage of the input distribution or patterns in the input. Given…
We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…
This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…
Let $(X,\tau)$ be a Polish space with Borel probability measure $\mu,$ and $G$ a locally finite one-ended Borel graph on $X.$ We show that $G$ admits a Borel one-ended spanning tree generically. If $G$ is induced by a free Borel action of…
We consider the creation conditions of diverse hierarchical trees both analytically and numerically. A connection between the probabilities to create hierarchical levels and the probability to associate these levels into a united structure…
This work concerns the study of properties of a group of Koszul algebras coming from the toric ideals of a chordal bipartite infinite family of graphs (alternately, these rings may be interpreted as coming from determinants of certain…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
Random Forests and related tree-based methods are popular for supervised learning from table based data. Apart from their ease of parallelization, their classification performance is also superior. However, this performance, especially…
The main focus of this contribution is on the harmonic Bergman spaces $\mathcal{B}_{\alpha}^{p}$ on the $q$-homogeneous tree $\mathfrak{X}_q$ endowed with a family of measures $\sigma_\alpha$ that are constant on the horocycles tangent to a…
Tree-size distribution is one of the most investigated subjects in plant population biology. The forestry literature reports that tree-size distribution trajectories vary across different stands and/or species, while the metabolic scaling…
We are interested in the asymptotics of random trees built by linear preferential attachment, also known in the literature as Barab\'asi-Albert trees or plane-oriented recursive trees. We first prove a conjecture of Bubeck, Mossel \& R\'acz…
In this paper we propose and study a class of simple, nonparametric, yet interpretable measures of association between two random variables $X$ and $Y$ taking values in general topological spaces. These nonparametric measures -- defined…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…