Related papers: Rescaled entropy of cellular automata
We show that in the category of effective $Z$ dynamical systems there is a universal system, i.e. one that factors onto every other effective system. In particular, for d $\geq 3$ there exist d-dimensional shifts of finite type which are…
For differentiable dynamical systems with dominated splittings, we give upper estimates on the measure-theoretic tail entropy in terms of Lyapunov exponents. As our primary application, we verify the upper semi-continuity of metric entropy…
Whether a system is to be considered complex or not depends on how one searches for correlations. We propose a general scheme for calculation of entropies in lattice systems that has high flexibility in how correlations are successively…
Recent experiments by Springer and Kenyon have shown that a deep neural network can be trained to predict the action of $t$ steps of Conway's Game of Life automaton given millions of examples of this action on random initial states.…
Let (lambda_d)(p) be the p monomer-dimer entropy on the d-dimensional integer lattice Z^d, where p in [0,1] is the dimer density. We give upper and lower bounds for (lambda_d)(p) in terms of expressions involving (lambda_(d-1))(q). The…
A transition from asymmetric to symmetric patterns in time-dependent extended systems is described. It is found that one dimensional cellular automata, started from fully random initial conditions, can be forced to evolve into complex…
Generalizing the motion representation we introduced for number-conserving rules, we give a systematic way to construct a generalized motion representation valid for non-conservative rules using the expression of the current, which appears…
In this paper, we study reversibility of one-dimensional(1D) linear cellular automata(LCA) under null boundary condition, whose core problems have been divided into two main parts: calculating the period of reversibility and verifying the…
We numerically test the method of non-sequential recursive pair substitutions to estimate the entropy of an ergodic source. We compare its performance with other classical methods to estimate the entropy (empirical frequencies, return…
The main goal of this work is to establish an asymptotic form of Bressan's mixing conjecture. To this end, we develop an ergodic-theoretic framework for incompressible DiPerna-Lions flows. Lyapunov exponents are defined via an…
We introduce a novel framework of reservoir computing, that is capable of both connectionist machine intelligence and symbolic computation. Cellular automaton is used as the reservoir of dynamical systems. Input is randomly projected onto…
The new estimates of the conditional Shannon entropy are introduced in the framework of the model describing a discrete response variable depending on a vector of d factors having a density w.r.t. the Lebesgue measure in R^d. Namely, the…
We introduce a class of cellular automata growth models on the two-dimensional integer lattice with finite cross neighborhoods. These dynamics are determined by a Young diagram $\mathcal Z$ and the radius $\rho$ of the neighborhood, which…
We find a new formula for the limit of the capacity of certain sequences of multidimensional semiconstrained systems as the dimension tends to infinity. We do so by generalizing the notion of independence entropy, originally studied in the…
For the study of chaotic dynamics and dimension of attractors the concepts of the Lyapunov exponents was found useful and became widely spread. Such characteristics of chaotic behavior, as the Lyapunov dimension and the entropy rate, can be…
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial…
In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…
This investigation studies the ergodic properties of reversible linear cellular automata over $\mathbb{Z}_m$ for $m \in \mathbb{N}$. We show that a reversible linear cellular automaton is either a Bernoulli automorphism or non-ergodic. This…
Recursive equations for the number of cells with nonzero values at $n$-th step for some two-dimensional reversible second-order cellular automata are proved in this work. Initial configuration is a single cell with the value one and all…
We develop a higher-dimensional extension of multifractal analysis for typical fiber-bunched linear cocycles. Our main result is a relative variational principle, which shows that the topological entropy of Lyapunov exponent level sets can…