Related papers: Characteristic measures for language stable subshi…
We introduce and study dynamical systems and measures on stationary generalized Bratteli diagrams $B$ that are represented as the union of countably many classical Pascal-Bratteli diagrams. We describe all ergodic tail invariant measures on…
We construct symbolic dynamics for flows with positive speed in any dimension: for each $\chi>0$, we code a set that has full measure for every invariant probability measure which is $\chi$--hyperbolic. In particular, the coded set contains…
We show that the $\mathscr{B}$-free subshift $(S,X_{\mathscr{B}})$ associated to a $\mathscr{B}$-free system is intrinsically ergodic, i.e.\ it has exactly one measure of maximal entropy. Moreover, we study invariant measures for such…
We prove that a shift ergodic measure on a topologically mixing sub-shift is isomorphic to a Bernoulli shift whenever it is quasi invariant under permutations of finite number of coordinates. We prove also that Gibbs measures on…
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 survey the connections between entropy, chaos, and independence in topological dynamics. We present extensions of two classical results placing the following notions in the context of symbolic dynamics: 1. Equivalence of positive entropy…
The existence of the {\em typical set} is key for data compression strategies and for the emergence of robust statistical observables in macroscopic physical systems. Standard approaches derive its existence from a restricted set of…
Permutation entropy quantifies the diversity of possible orderings of the values a random or deterministic system can take, as Shannon entropy quantifies the diversity of values. We show that the metric and permutation entropy…
In this article we show that a large class of infinite measure preserving dynamical systems that do not admit physical measures nevertheless exhibit strong statistical properties. In particular, we give sufficient conditions for existence…
In this work, we are interested in characterizing typical (generic) dimensional properties of invariant measures associated with the full-shift system, $T$, in a product space whose alphabet is a perfect and separable metric space (thus,…
We study the set of irregular points for topologically mixing subshifts of finite type. It is well known that despite the irregular set having zero measure for every invariant measure, it has full topological entropy and full Hausdorff…
We introduce amorphic complexity as a new topological invariant that measures the complexity of dynamical systems in the regime of zero entropy. Its main purpose is to detect the very onset of disorder in the asymptotic behaviour. For…
Ergodic optimization aims to single out dynamically invariant Borel probability measures which maximize the integral of a given "performance" function. For a continuous self-map of a compact metric space and a dense set of continuous…
Given a surface $M$ and a Borel probability measure $\nu$ on the group of $C^2$-diffeomorphisms of $M$, we study $\nu$-stationary probability measures on $M$. Assuming the positivity of a certain entropy, the following dichotomy is proved:…
For any hyperbolic rational map and any net of Borel probability measures on the space of Borel probability measures on the Julia set, we show that this net satisfies a strong form of the large deviation principle with a rate function given…
We show that a non-wandering dynamical system with the shadowing property is either equicontinuous or has positive entropy and that in this context uniformly positive entropy is equivalent to weak mixing. We also show that weak mixing…
In this work, we are interested in characterizing typical (generic) dimensional properties of invariant measures associated with the full-shift system, $T$, in a product space whose alphabet is a countable set. More specifically, we show…
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…
Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not…
The complexity of a system description is a function of the entropy of its symbolic description. Prior to computing the entropy of the system description, an observation scale has to be assumed. In natural language texts, typical scales are…