相关论文: Stability in random Boolean cellular automata on t…

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…

It has been shown that uniform as well as non-uniform cellular automata (CA) can be evolved to perform certain computational tasks. Random Boolean networks are a generalization of two-state cellular automata, where the interconnection…

We study a neural network model of interacting stochastic discrete two--state cellular automata on a regular lattice. The system is externally tuned to a critical point which varies with the degree of stochasticity (or the effective…

Species or population that proliferate faster than others become dominant in numbers. Catalysis allows catalytic sets within a molecular reaction network to dominate the non catalytic parts of the network by processing most of the available…

Bagging is an important technique for stabilizing machine learning models. In this paper, we derive a finite-sample guarantee on the stability of bagging for any model. Our result places no assumptions on the distribution of the data, on…

The functioning of a living cell is largely determined by the structure of its regulatory network, comprising non-linear interactions between regulatory genes. An important factor for the stability and evolvability of such regulatory…

In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also…

We present evidence that operation of QCA (Quantum Cellular Automaton) cells with four dots is possible with an occupancy of 4N+2 electrons per cell (N being an integer). We show that interaction between cells can be described in terms of a…

Precipitation/dissolution reactions coupled with solute transport are modelled as a cellular automaton in which solute molecules perform a random walk on a regular lattice and react according to a local probabilistic rule. Stationary solid…

A novel, information-based classification of elementary cellular automata is proposed that circumvents the problems associated with isolating whether complexity is in fact intrinsic to a dynamical rule, or if it arises merely as a product…

We discovered that certain patterns called injective patterns remain stable during the revolution process, allowing us to create many reversible CA simply by using them to design the revolution rules. By examining injective patterns, we…

Neural Cellular Automata (NCAs) offer a way to study the growth of two-dimensional artificial organisms from a single seed cell. From the outset, NCA-grown organisms have had issues with stability, their natural boundary often breaking down…

We study the stabilization time of two common types of influence propagation. In majority processes, nodes in a graph want to switch to the most frequent state in their neighborhood, while in minority processes, nodes want to switch to the…

We propose a probabilistic cellular automata model for the spread of innovations, rumors, news, etc. in a social system. The local rule used in the model is outertotalistic, and the range of interaction can vary. When the range R of the…

In this paper we study the statistical properties of a reversible cellular automaton in two out-of-equilibrium settings. In the first part we consider two instances of the initial value problem, corresponding to the inhomogeneous quench and…

We present a one dimensional reversible block cellular automaton, where the time evolution is dictated by a period 3 cycle of update rules. At each time step a subset of the cells is updated using a four site rule with two control bits and…

In addition to the $\lambda$ parameter, we have found another parameter which characterize the class III, class II and class IV patterns more quantitatively. It explains why the different classes of patterns coexist at the same $\lambda$.…

We propose a method for constructing 9-variable cryptographic Boolean functions from the iterates of 5-variable cellular automata rules. We then analyze, for important cryptographic properties of 5-variable cellular automata rules, how they…

The cellular automaton (CA) pulsing model (arXiv:1806.06416) described the surprising phenomenon of spontaneous, sustained and robust rhythmic oscillations, pulsing dynamics, when random wiring is applied to a 2D `glider' rule running in a…

The five libration points of a sun-planet system are stable or unstable fixed positions at which satellites or asteroids can remain fixed relative to the two orbiting bodies. A moon orbiting around the planet causes a time-dependent…