Related papers: Trees in positive entropy subshifts

We study the asymptotic distribution of integers sharing the same rooted-tree structure that encodes their complete prime factorization tower. For each tree we derive an explicit density formula depending only on a pair $(m,k)$, the density…

We define a hierarchy of systems with topological completely positive entropy in the context of continuous countable amenable group actions on compact metric spaces. For each countable ordinal we construct a dynamical system on the…

In this paper we consider finitary symmetric random walks on groups. We construct new possible asymptotics for the drift. We show that the drift can be very close to linear ant yet sublinear. We also give estimates for entropy growth of…

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…

Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…

It has been demonstrated that excitable media with a tree structure performed better than other network topologies, it is natural to consider neural networks defined on Cayley trees. The investigation of a symbolic space called tree-shift…

Finite alphabets of at least three letters permit the construction of square-free words of infinite length. We show that the entropy density is strictly positive and derive reasonable lower and upper bounds. Finally, we present an…

We present a streamlined proof of a result essentially present in previous work of the author, namely that for every set $S = \{s_1, s_2, \ldots\} \subset \mathbb{N}$ of zero Banach density and finite set $A$, there exists a minimal…

In this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group $G$, if $X$ is a $G$-SFT with positive topological entropy $h(X)…

Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…

There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional evidence in favor of this theory by showing that several…

We study the topological entropy of hom tree-shifts and show that, although the topological entropy is not a conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In…

A simple braid is a positive braid that can be drawn so that any two strands cross at most once. We prove that as $n \to \infty$, the proportion of simple braids on $n$ strands that have positive topological entropy tends toward $100\%$.…

Domino tilings have been studied extensively for both their statistical properties and their dynamical properties. We construct a subshift of finite type using matching rules for several types of dominos. We combine the previous results…

We show that if a strictly positive joint probability distribution for a set of binary random variables factors according to a tree, then vertex separation represents all and only the independence relations enclosed in the distribution. The…

In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that…

We introduce a new family of shift spaces --- the subordinate shifts. Using subordinate shifts we prove in an elementary way that for every nonnegative real number $t$ there is a shift space with entropy $t$.

We construct an example of a subperiodic tree whose intermediate branching number is strictly less than the lower intermediate growth rate. This answers a question of Amir and Yang (2022) in the negative.

Evolutionary models used for describing molecular sequence variation suppose that at a non-recombining genomic segment, sequences share ancestry that can be represented as a genealogy--a rooted, binary, timed tree, with tips corresponding…

We consider stochastic processes indexed by the vertices of an infinite binary tree having a simple recursive structure. The value at any vertex is some fixed function of the values at the two daughter vertices together with some…