相关论文: Algorithmic Mapping Criticality into Self Organize…

We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…

We introduce a general theoretical scheme for a class of phenomena characterized by an extremal dynamics and quenched disorder. The approach is based on a transformation of the quenched dynamics into a stochastic one with cognitive memory…

The objective is to find a Cellular Automata rule that can form a 2D point pattern with a maximum number of points (1-cells). Points are not allowed to touch each other, they have to be separated by 0-cells, and every 0-cell can find at…

We study monotone cellular automata (also known as $\mathcal{U}$-bootstrap percolation) in $\mathbb{Z}^d$ with random initial configurations. Confirming a conjecture of Balister, Bollob\'as, Przykucki and Smith, who proved the corresponding…

Probabilistic cellular automata (PCA) are used to model a variety of discrete spatially extended systems undergoing parallel-updating. We propose an embedding of a number of classical nonequilibrium concepts in the PCA-world. We start from…

We show that cellular automata can classify data by inducing a form of dynamical phase coexistence. We use Monte Carlo methods to search for general two-dimensional deterministic automata that classify images on the basis of activity, the…

Neuronal networks can present activity described by power-law distributed avalanches presumed to be a signature of a critical state. Here we study a random-neighbor network of excitable cellular automata coupled by dynamical synapses. The…

Cellular automata and other discrete dynamical systems have long been studied as models of emergent complexity. Recently, neural cellular automata have been proposed as models to investigate the emerge of a more general artificial…

Sampling-based motion planning techniques have emerged as an efficient algorithmic paradigm for solving complex motion planning problems. These approaches use a set of probing samples to construct an implicit graph representation of the…

This work introduces a new problem, named as, affinity classification problem which is a generalization of the density classification problem. To solve this problem, we introduce temporally stochastic cellular automata where two rules are…

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…

In statistical and nonlinear systems, two qualitatively distinct parameter regions are typically identified: the regular region, characterized by smooth behavior of key quantities, and the critical region, where these quantities exhibit…

We propose the characterization of binary cellular automata using a set of behavioral metrics that are applied to the minimal Boolean form of a cellular automaton's transition function. These behavioral metrics are formulated to satisfy…

Design and control of autonomous systems that operate in uncertain or adversarial environments can be facilitated by formal modelling and analysis. Probabilistic model checking is a technique to automatically verify, for a given temporal…

An apparent violation of hyperscaling at the endpoint of the critical line in the Domany-Kinzel stochastic cellular automaton finds an elementary resolution upon noting that the order parameter is discontinuous at this point. We derive a…

We consider the problem of generating randomized control sequences for complex networked systems typically actuated by human agents. Our approach leverages a concept known as control improvisation, which is based on a combination of…

We present a family of one-dimensional cellular automata modeling the diffusion of an innovation in a population. Starting from simple deterministic rules, we construct models parameterized by the interaction range and exhibiting a…

The origin of self-organized criticality in a model without conservation law (Olami, Feder, and Christensen, Phys. Rev. Lett. {\bf 68}, 1244 (1992)) is studied. The homogeneous system with periodic boundary condition is found to be periodic…

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…

We present a diagrammatic method to build up sophisticated cellular automata (CAs) as models of complex physical systems. The diagrams complement the mathematical approach to CA modeling, whose details are also presented here, and allow CAs…