Related papers: Orbits of Bernoulli Measures in Cellular Automata
The paper formalizes and extends the idea of local structure approximation for cellular automata originally proposed by Gutowitz et. al. We start with a review of the construction of a probability measure on the set of bi-infinite strings…
We present a method for construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that…
Probabilistic Cellular Automata are a generalization of Cellular Automata. Despite their simple definition, they exhibit fascinating and complex behaviours. The stationary behaviour of these models changes when model parameters are varied,…
We discuss various properties of Probabilistic Cellular Automata, such as the structure of the set of stationary measures and multiplicity of stationary measures (or phase transition) for reversible models.
Let us consider the simplest model of one-dimensional probabilistic cellular automata (PCA). The cells are indexed by the integers, the alphabet is {0, 1}, and all the cells evolve synchronously. The new content of a cell is randomly…
Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the…
The $\mu$-limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to in- finity. In this article, for a given subshift in a large class of subshifts, we…
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that…
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…
Let $(\az,F)$ be a bipermutative algebraic cellular automaton. We present conditions which force a probability measure which is invariant for the $\N\times\Z$-action of $F$ and the shift map $\s$ to be the Haar measure on $\gs$, a closed…
Cellular automata are dynamical systems defined on lattices and commuting with the Bernoulli shift. In this work, we focus on the spectral properties of D-dimensional cellular automata. We give a characterization of their spectrum from both…
We provide an example of a discrete-time Markov process on the three-dimensional infinite integer lattice with Z_q-invariant Bernoulli-increments which has as local state space the cyclic group Z_q. We show that the system has a unique…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…
We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…
We study the notion of limit sets of cellular automata associated with probability measures (mu-limit sets). This notion was introduced by P. Kurka and A. Maass. It is a refinement of the classical notion of omega-limit sets dealing with…
Motivated by recent investigations of Sophie Grivaux and \'Etienne Matheron on the existence of invariant measures in Linear Dynamics, we introduce the concept of locally bounded orbit for a continuous linear operator $T:X\longrightarrow X$…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
Extending to all probability measures the notion of m-equicontinuous cellular automata introduced for Bernoulli measures by Gilman, we show that the entropy is null if m is an invariant measure and that the sequence of image measures of a…
Probabilistic Cellular Automata are extended stochastic systems, widely used for modelling phenomena in many disciplines. The possibility of controlling their behaviour is therefore an important topic. We shall present here an approach to…