Related papers: Entropy rates for Horton self-similar trees
Topologically constrained genome-like polymers often double-fold into tree-like configurations. Here we calculate the exact number of tightly double-folded configurations available to a ring polymer in ideal conditions. For this purpose, we…
The definition of $k^{th}$-order empirical entropy of strings is extended to node labelled binary trees. A suitable binary encoding of tree straight-line programs (that have been used for grammar-based tree compression before) is shown to…
We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the…
The Horton-Strahler number -- also called the register function -- is a combinatorial tool that quantifies the branching complexity of a rooted tree. We study the law of the Horton-Strahler number of stable Galton-Watson trees conditioned…
The paper establishes a weak version of Horton self-similarity for a tree representation of Kingman's coalescent process. The proof is based on a Smoluchowski-type system of ordinary differential equations for the number of branches of a…
Consider a density $f$ on $[0,1]$ that must be estimated from an i.i.d. sample $X_1,...,X_n$ drawn from $f$. In this note, we study binary-tree-based histogram estimates that use recursive splitting of intervals. If the decision to split an…
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…
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…
Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…
In this paper, we redesign and simplify an algorithm due to Remy et al. for the generation of rooted planar trees that satisfies a given partition of degrees. This new version is now optimal in terms of random bit complexity, up to a…
We introduce two operads which own the set of planar forests as a basis. With its usual product and two other products defined by different types of graftings, the algebra of planar rooted trees H becomes an algebra over these operads. The…
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…
We study Markov tree-shifts given by $k$ transition matrices, one for each of its $k$ directions. We provide a method to characterize the complexity function for these tree-shifts, used to calculate the tree entropies defined by Ban and…
In "Hopf algebra of the planar binary trees", Adv. Math. 139 (1998), no. 2, 293--309, we constructed by induction a graded associative product on the vector space generated by the planar binary trees (resp. the permutations). In the present…
The statistical picture of the solution space for a binary perceptron is studied. The binary perceptron learns a random classification of input random patterns by a set of binary synaptic weights. The learning of this network is difficult…
We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…
This article presents two novel algorithms for generating random increasing trees. The first algorithm efficiently generates strictly increasing binary trees using an ad hoc method. The second algorithm improves the recursive method for…
Tree-level scattering amplitudes for a scalar particle coupled to an arbitrary number N of photons and a single graviton are computed. We employ the worldline formalism as the main tool to compute the irreducible part of the amplitude,…
We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…
We introduce some natural families of distributions on rooted binary ranked plane trees with a view toward unifying ideas from various fields, including macroevolution, epidemiology, computational group theory, search algorithms and other…