Related papers: Entropy-efficient finitary codings
Basing on the exactly solvable prototypical model, the critical transverse Ising ring with or without ring frustration, we establish the concept of nonlocality in a many-body system in the thermodynamic limit by defining the nonlocal…
Asymptotically entropy of chaotic systems increases linearly and the sensitivity to initial conditions is exponential with time: these two behaviors are related. Such relationship is the analogous of and under specific conditions has been…
For any $d \geq 1$, random $\mathbb{Z}^d$ shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter $\alpha \in [0,1]$, an alphabet $\mathcal{A}$, and a scale $n \in \mathbb{N}$, one obtains a distribution…
We characterize the condition for two finite index endomorphisms on an AFD factor to be approximately unitarily equivalent. The characterization is given by using the canonical extension of endomorphisms, which is introduced by Izumi. Our…
We show that a large collection of statistical mechanical systems with quadratically represented Hamiltonians on the complete graph can be extended to infinite exchangeable processes. This extends a known result for the ferromagnetic…
'Causal' direction is of great importance when dealing with complex systems. Often big volumes of data in the form of time series are available and it is important to develop methods that can inform about possible causal connections between…
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)…
We study a skew product IFS on the cylinder defined by Baker-like maps associated to a finite family of potential functions and the doubling map. We show that there exist a compact invariant set with attractive behavior and a random SRB…
Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…
Given a number field K, we consider families of critically separable rational maps of degree d over K possessing a certain fixed-point and multiplier structure. With suitable notions of isomorphism and good reduction between rational maps…
We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a…
The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. For any given…
We examine the properties of existentially closed (R^omega-embeddable) II_1 factors. In particular, we use the fact that every automorphism of an existentially closed (R^omega-embeddable) II_1 factor is approximately inner to prove that…
Ergodic theory includes several notions of entropy for probability-preserving actions of countable groups. These include Kolmogorov--Sinai entropy based on F\o lner sequences for amenable groups, entropy defined using a random ordering of…
Aiming at a better understanding of finite groups as finite dynamical systems, we show that by a version of Fitting's Lemma for groups, each state space of an endomorphism of a finite group is a graph tensor product of a finite directed…
Inspired by Katok's intermediate entropy property [Inst. Hautes \'Etudes Sci. Publ. Math. 51 (1980), 137-173], we introduce and study the notion of entropy flexibility for discrete-time and continuous-time dynamical systems. By using…
Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…
The (measure-theoretical) entropy of a diffeomorphism along an expanding invariant foliation is the rate of complexity generated by the diffeomorphism along the leaves of the foliation. We prove that this number varies upper…
We put forth a new computational notion of entropy, measuring the (in)feasibility of sampling high-entropy strings that are consistent with a given generator. Specifically, the i'th output block of a generator G has accessible entropy at…
The basic quantity for the description of the statistical properties of physical systems is the density of states or equivalently the microcanonical entropy. Macroscopic quantities of a system in equilibrium can be computed directly from…