相关论文: Rescaled entropy of cellular automata
We investigate one-dimensional elementary probabilistic cellular automata (PCA) whose dynamics in first-order mean-field approximation yields discrete logisticlike growth models for a single-species unstructured population with…
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
We compute the diffusion coefficient and the Lyapunov exponent for a diffusive intermittent map by means of cycle expansion of dynamical zeta functions. The asymptotic power law decay of the coefficients of the relevant power series are…
We propose and discuss two variants of kinetic particle models - cellular automata in 1+1 dimensions, which have some appeal due to their simplicity and intriguing properties which could warrant further research and applications. The first…
We investigate number conserving cellular automata with up to five inputs and two states with the goal of comparing their dynamics with diffusion. For this purpose, we introduce the concept of decompression ratio describing expansion of…
Tempered exponential dichotomy formulates the nonuniform hyperbolicity for random dynamical systems. It was described by admissibility of a pair of function classes defined with Lyapunov norms, For MET-systems (systems satisfying the…
The $\beta$-Delaunay tessellation in $\mathbb{R}^{d-1}$ is a generalization of the classical Poisson-Delaunay tessellation. As a first result of this paper we show that the shape of a weighted typical cell of a $\beta$-Delaunay…
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In the present paper, we introduce three notions of simulation…
We describe a class of cellular automata (CAs) that are end-to-end differentiable. DCAs interpolate the behavior of ordinary CAs through rules that act on distributions of states. The gradient of a DCA with respect to its parameters can be…
This talk advocates intrinsic universality as a notion to identify simple cellular automata with complex computational behavior. After an historical introduction and proper definitions of intrinsic universality, which is discussed with…
Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…
We study the recurrence to mistake dynamical balls, that is, dynamical balls that admit some errors and whose proportion of errors decrease tends to zero with the length of the dynamical ball. We prove, under mild assumptions, that the…
We observe a realization of a stationary generalized weighted Voronoi tessellation of the d-dimensional Euclidean space within a bounded observation window. Given a geometric characteristic of the typical cell, we use the minus-sampling…
We prove the entropic continuity of Lyapunov exponent for C^r maps of the interval or of the circle with large entropy for r>1, without making any assumptions on the set of critical points. A consequence is the upper semi-continuity of…
We establish several extensions of the well-known Garden of Eden theorem for non-uniform cellular automata over the full shifts and over amenable group universes. In particular, our results describe quantitatively the relations between the…
Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to…
In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…
Let $f$ be a $C^2$ diffeomorphism on a compact manifold. Ledrappier and Young introduced entropies along unstable foliations for an ergodic measure $\mu$. We relate those entropies to covering numbers in order to give a new upper bound on…
We show how the trajectories of $d$-dimensional cellular automata (CA) can be used to determine the ground states of $(d+1)$-dimensional classical spin models, and we characterise their quantum phase transition, when in the presence of a…