Related papers: Gaussian concentration bounds for probabilistic ce…
The properties of two-state nearest-neighbour cellular automata (CA) that are capable of density classification are discussed. It is shown that these CA actually conserve the total density, rather than merely classifying it. This is also…
Reversible Probabilistic Cellular Automata are a special class of automata whose stationary behavior is described by Gibbs-like measures. For those models the dynamics can be trapped for a very long time in states which are very different…
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…
Channel attention mechanisms have been commonly applied in many visual tasks for effective performance improvement. It is able to reinforce the informative channels as well as to suppress the useless channels. Recently, different channel…
Classical cellular automata represent a class of explicit discrete spacetime lattice models in which complex large-scale phenomena emerge from simple deterministic rules. With the goal to uncover different physically distinct classes of…
We study probabilistic cellular automata (PCA) and quantum cellular automata (QCA) as frameworks for solving the Maximum Independent Set (MIS) problem. We first introduce a synchronous PCA whose dynamics drives the system toward the…
Facilitated or kinetically constrained spin models (KCSM) are a class of interacting particle systems reversible w.r.t. to a simple product measure. Each dynamical variable (spin) is re-sampled from its equilibrium distribution only if the…
We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…
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,…
We construct a four-dimensional lattice-gas model with finite-range interactions that has non-periodic, ``quasicrystalline'' Gibbs states at low temperatures. Such Gibbs states are probability measures which are small perturbations of…
Lower bounds for persistence probabilities of stationary Gaussian processes in discrete time are obtained under various conditions on the spectral measure of the process. Examples are given to show that the persistence probability can decay…
Cellular automata (CA) are a class of computational models that exhibit rich dynamics emerging from the local interaction of cells arranged in a regular lattice. In this work we focus on a generalised version of typical CA, called graph…
Cellular Automata are discrete dynamical systems that evolve following simple and local rules. Despite of its local simplicity, knowledge discovery in CA is a NP problem. This is the main motivation for using data mining techniques for CA…
This note is concerned with weakly interacting stochastic particle systems with possibly singular pairwise interactions. In this setting, we observe a connection between entropic propagation of chaos and exponential concentration bounds for…
The Gaussian phase approximation (GPA) underlies many standard diffusion magnetic resonance (MR) signal models, yet its validity is rarely scrutinized. Here, we assess the validity of the GPA by analytically deriving the excess phase…
Each cell of a two-dimensional lattice is painted one of k colors, arranged in a "color wheel." The colors advance (0 to k-1 mod k) either automatically or by contact with at least a threshold number of successor colors in a prescribed…
We develop a transport-entropy framework for Gaussian concentration inequalities on the infinite product space $S^{\mathbb Z^d}$, where $S$ is a finite set, in which sensitivity is measured by the $\ell^2$-norm of local oscillations. We…
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in…
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…
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…