Related papers: A non-ergodic probabilistic cellular automaton wit…
We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for…
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 study the determinisation and unambiguisation problems of weighted automata over the rational field: Given a weighted automaton, can we determine whether there exists an equivalent deterministic, respectively unambiguous, weighted…
Principal Component Analysis (PCA) is a transform for finding the principal components (PCs) that represent features of random data. PCA also provides a reconstruction of the PCs to the original data. We consider an extension of PCA which…
We consider the problem of metastability in a probabilistic cellular automaton (PCA) with a parallel updating rule which is reversible with respect to a Gibbs measure. The dynamical rules contain two parameters $\beta$ and $h$ which…
We study a class of dynamical systems generated by random substitutions, which contains both intrinsically ergodic systems and instances with several measures of maximal entropy. In this class, we show that the measures of maximal entropy…
Let $\alpha: G\curvearrowright X$ be a minimal free continuous action of an infinite countable amenable group on an infinite compact metrizable space. In this paper, under the hypothesis that the invariant ergodic probability Borel measure…
For a compact metric space $X$ with a group $G$ acting on it continuously, an invariant random compact is a Borel probability measure on the space of nonempty compact subsets of $X$ that is invariant under the action of $G$. The action is…
In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used…
In this paper, we prove that there is a strongly universal cellular automaton on the pentagrid with six states. For each cell c, Moore neighbourhood consists of the cells which share a vertex with c. Moreover, the rules are rotation…
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…
Principal component analysis (PCA) is a widely used technique for data analysis and dimension reduction with numerous applications in science and engineering. However, the standard PCA suffers from the fact that the principal components…
Starting from integrable cellular automata we present a novel form of Painlev\'e equations. These equations are discrete in both the independent variable and the dependent one. We show that they capture the essence of the behavior of the…
While the surjectivity of the global map in two-dimensional cellular automata (2D CA) is undecidable in general, in specific cases one can often decide if the rule is surjective or not. We attempt to classify as many 2D CA as possible by…
It is well-known that the Lebesgue measure is the unique absolutely continuous invariant probability measure under the $p$-adic transformation. The purpose of this paper is to characterize the family of all invariant probability measures…
We study the invariant measures of typical $C^0$ maps on compact connected manifolds with or without boundary, and also of typical homeomorphisms. We prove that the weak$^*$ closure of the set of ergodic measurescoincides with the weak$^*$…
Quantum Cellular Automata are unitary maps that preserve locality and respect causality. We identify them, in any dimension, with simple tensor networks (PEPU) whose bond dimension does not grow with the system size. As a result, they…
We investigate the low-noise regime of a large class of probabilistic cellular automata, including the North-East-Center model of Toom. They are defined as stochastic perturbations of cellular automata belonging to the category of monotonic…
Every transitive cellular automaton (CA) is sensitive to initial conditions. We study this implication in the more general context of non-uniform cellular automata (NUCA) with finitely many different local update rules assigned to cells. We…
PCA is a classical statistical technique whose simplicity and maturity has seen it find widespread use as an anomaly detection technique. However, it is limited in this regard by being sensitive to gross perturbations of the input, and by…