Related papers: Dynamical systems arising from random substitution…
Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…
We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…
We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…
Substitution systems evolve in time by generating sequences of symbols from a finite alphabet: At a certain iteration step, the existing symbols are systematically replaced by blocks of $N_{k}$ symbols also within the alphabet (with…
We consider word complexity and topological entropy for random substitution subshifts. In contrast to previous work, we do not assume that the underlying random substitution is compatible. We show that the subshift of a primitive random…
We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of…
We construct a family of ergodic measures on random substitution subshifts (RS-subshifts) associated to a primitive random substitution. In particular, the word frequencies of every finite legal word exist for almost every element of the…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
We examine the issue of stability of probability in reasoning about complex systems with uncertainty in structure. Normally, propositions are viewed as probability functions on an abstract random graph where it is implicitly assumed that…
The concept of random dynamical system is a comparatively recent development combining ideas and methods from the well developed areas of probability theory and dynamical systems. Due to our inaccurate knowledge of the particular physical…
We study a class of dynamical systems generated by random substitutions, which contains both intrinsically ergodic systems and instances with several measures of maximal entropy. In this class, we show that the measures of maximal entropy…
Paper withdrawn; will be replaced by revised version containing application to lattice models as well. We study hierarchical properties of Sturmian words. These properties are similar to those of substitution dynamical systems. This…
We consider stationary stochastic dynamical systems evolving on a compact metric space, by perturbing a deterministic dynamics with a random noise, added according to an arbitrary probabilistic distribution. We prove the maximal and…
This article presents a general description of dynamical systems using the language of enriched functors and enriched natural transformations. This framework is essential to establish the equivalence of three descriptions of dynamics -- a…
We describe classes of ergodic dynamical systems for which some statistical properties are known exactly. These systems have integer dimension, are not globally dissipative, and are defined by a probability density and a two-form. This…
This paper is a preliminary work to address the problem of dynamical systems with parameters varying in time. An idea to predict their behaviour is proposed. These systems are called \emph{transient systems}, and are distinguished from…
We show that, for every finitely generated group with decidable word problem and undecidable domino problem, there exists a sequence of effective subshifts whose inverse limit is not the topological factor of any effective dynamical system.…
Virtually anything can be and is ranked; people, institutions, countries, words, genes. Rankings reduce complex systems to ordered lists, reflecting the ability of their elements to perform relevant functions, and are being used from…
We consider the collection of uniformly discrete point sets in Euclidean space equipped with the vague topology. For a point set in this collection, we characterise minimality of an associated dynamical system by almost repetitivity of the…
The theory of substitution sequences and their higher-dimensional analogues is intimately connected with symbolic dynamics. By systematically studying the factors (in the sense of dynamical systems theory) of a substitution dynamical…