Related papers: Trees in positive entropy subshifts
Subshifts are shift invariant closed subsets of $\Sigma^{\mathbb{Z}^d}$ , minimal subshifts are subshifts in which all points contain the same patterns. It has been proved by Jeandel and Vanier that the Turing degree spectra of non-periodic…
We study the distribution of fringe trees in Patricia tries (extending earlier results by Ischebeck (2025)) and compressed binary search trees; both cases are random binary trees that have been compressed by deleting nodes of outdegree 1 so…
Polymer chains decorated with a fraction of monomers capable of forming reversible bonds form transient polymer networks that are important in soft and biological systems. If chains are flexible and the attractive monomers are all of the…
We study a branching-process random iterated function system (RIFS) defined by a recursive replacement of leaves by finite subtrees at strictly smaller contraction scales. This construction yields a tree-valued, infinite-depth random…
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 give a short and elementary proof of the fact that every metric space of finite asymptotic dimension can be embedded into a finite product of trees.
The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each number occurs in the tree exactly once and in the form $a/b$, where are $a$ and $b$ are relatively prime positive integers. In this…
A few notes about infinite trees in a descriptive set-theoretic setting.
In this paper we give a fully combinatorial description of the zero entropy periodic patterns on trees. Unlike previously known characterizations of such patterns, our criterion is independent of any particular topological realization of…
Consider a random real tree whose leaf set, or boundary, is endowed with a finite mass measure. Each element of the tree is further given a type, or allele, inherited from the most recent atom of a random point measure…
Whereas for strings, higher-order empirical entropy is the standard entropy measure, several different notions of empirical entropy for trees have been proposed in the past, notably label entropy, degree entropy, conditional versions of the…
We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…
We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…
Erd\H{o}s conjectured that for any set $A\subseteq \mathbb{N}$ with positive lower asymptotic density, there are infinite sets $B,C\subseteq \mathbb{N}$ such that $B+C\subseteq A$. We verify Erd\H{o}s' conjecture in the case that $A$ has…
Random forests have long been considered as powerful model ensembles in machine learning. By training multiple decision trees, whose diversity is fostered through data and feature subsampling, the resulting random forest can lead to more…
We give a short proof of the fact that every set of natural numbers with positive upper Banach density contains the sum of two infinite sets. The approach simplifies earlier existing proofs.
The last decade has witnessed a growing interest in random forest models which are recognized to exhibit good practical performance, especially in high-dimensional settings. On the theoretical side, however, their predictive power remains…
Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…
The automorphism group of a one dimensional shift space over a finite alphabet exhibits different types of behavior: for a large class with positive entropy, it contains a rich collection of subgroups, while for many shifts of zero entropy,…
Tree containment problem is a fundamental problem in phylogenetic study, as it is used to verify a network model. It asks whether a given network contain a subtree that resembles a binary tree. The problem is NP-complete in general, even in…