Related papers: Characterizing Asymptotic Randomization in Abelian…
Consider a finite Abelian group (G,+), with |G|=p^r, p a prime number, and F: G^N -> G^N the cellular automaton given by {F(x)}_n= A x_n + B x_{n+1} for any n in N, where A and B are integers relatively primes to p. We prove that if P is a…
There is evidence that biological systems, such as the brain, work at a critical regime robust to noise, and are therefore able to remain in it under perturbations. In this work, we address the question of robustness of critical systems to…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
We study the usual stochastic order between probability measures on preordered topological abelian groups, focusing on asymptotic and catalytic versions of the order. In the asymptotic version, a measure $\mu$ dominates a measure $\nu$ if…
We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…
We construct a cellular automaton (CA) model that describes the movement of a particle in a disordered system. The mathematical properties of the CA model were examined by varying the configuration of grid and determining the number of…
The emergence of randomness from unitary quantum dynamics is a central problem across diverse disciplines, ranging from the foundations of statistical mechanics to quantum algorithms and quantum computation. Physical systems are invariably…
This paper examines the asymptotic inference for AR(1) models with a possible structural break in the AR parameter $\beta $ near the unity at an unknown time $k_{0}$. Consider the model $y_{t}=\beta_{1}y_{t-1}I\{t\leq k_{0}\}+\beta…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov…
We introduce the property of pre-expansivity for cellular automata (CA): it is the property of being expansive on asymptotic pairs of configurations (i.e. configurations that differ in only finitely many positions). Pre-expansivity…
A random boolean cellular automaton is a network of boolean gates where the inputs, the boolean function, and the initial state of each gate are chosen randomly. In this article, each gate has two inputs. Let $a$ (respectively $c$) be the…
Motivated by the search for idempotent cellular automata (CA), we study CA that act almost as the identity unless they read a fixed pattern $p$. We show that constant and symmetrical patterns always produce idempotent CA, and 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 this article we study a class of shift-invariant and positive rate probabilistic cellular automata (PCA) on rooted d-regular trees $\mathbb{T}^d$. In a first result we extend the results of [10] on trees, namely we prove that to every…
Let X be a locally compact Abelian group. We consider linear forms of independent random variables with values in X. In doing so, one of the coefficients of the linear forms is a random variable with a Bernoulli distribution. For some…
In this dissertation, we study two of the global properties of 1-dimensional cellular automata (CAs) under periodic boundary condition, namely, reversibility and randomness. To address reversibility of finite CAs, we develop a mathematical…
Given a finite set of local constraints, we seek a cellular automaton (i.e., a local and uniform algorithm) that self-stabilises on the configurations that satisfy these constraints. More precisely, starting from a finite perturbation of a…
Let $X$ be a countable discrete Abelian group containing no elements of order 2, $\alpha$ be an automorphism of $X$, $\xi_1$ and $\xi_2$ be independent random variables with values in the group $X$ and distributions $\mu_1$ and $\mu_2$. The…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…