Related papers: On the Threshold of Chaos in Random Boolean Cellul…

Random boolean cellular automata are investigated, where each gate has two randomly chosen inputs and is randomly assigned a boolean function of its inputs. The effect of non-uniform distributions on the choice of the boolean functions is…

A variant of Kauffman's model of cellular metabolism is presented. It is a randomly generated network of boolean gates, identical to Kauffman's except for a small bias in favor of boolean gates that depend on at most one input. The bias is…

We consider random boolean cellular automata on the integer lattice, i.e., the cells are identified with the integers from 1 to $N$. The behaviour of the automaton is mainly determined by the support of the random variable that selects one…

It is an increasingly important problem to study conditions on the structure of a network that guarantee a given behavior for its underlying dynamical system. In this paper we report that a Boolean network may fall within the chaotic…

Previous study of cellular automata and random Boolean networks has shown emergent behavior occurring at the edge of chaos where the randomness (disorder) of internal connections is set to an intermediate critical value. The value at which…

The critical boundaries separating ordered from chaotic behavior in randomly wired S-state networks are calculated. These networks are a natural generalization of random Boolean nets and are proposed as on extended approach to genetic…

We undertake a systematic study of the dynamics of Boolean networks to determine the origin of chaos observed in recent experiments. Networks with nodes consisting of ideal logic gates are known to display either steady states, periodic…

A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority…

We observe deterministic chaos in a simple network of electronic logic gates that are not regulated by a clocking signal. The resulting power spectrum is ultra-wide-band, extending from dc to beyond 2 GHz. The observed behavior is…

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…

Random boolean networks are a model of genetic regulatory networks that has proven able to describe experimental data in biology. They not only reproduce important phenomena in cell dynamics, but they are also extremely interesting from a…

We study one dimensional binary Probabilistic Cellular Automaton (PCA) that interpolate between Wolfram's classical rules 23, 77, 178 and 232. These rules are the only ones that satisfy two criteria: (i) in the case of a majority in the…

Typical properties of computing circuits composed of noisy logical gates are studied using the statistical physics methodology. A growth model that gives rise to typical random Boolean functions is mapped onto a layered Ising spin system,…

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…

Random Boolean networks, originally invented as models of genetic regulatory networks, are simple models for a broad class of complex systems that show rich dynamical structures. From a biological perspective, the most interesting networks…

In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It has been shown…

We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…

We study Pippenger's model of Boolean networks with unreliable gates. In this model, the conditional probability that a particular gate fails, given the failure status of any subset of gates preceding it in the network, is bounded from…

The one-dimensional three-state cyclic cellular automaton is a simple spatial model with three states in a cyclic "rock-paper-scissors" prey-predator relationship. Starting from a random configuration, similar states gather in increasingly…

We study a Life-like cellular automaton rule $B2/S2345$ where a cell in state `0' takes state `1' if it has exactly two neighbors in state `1' and the cell remains in the state `1' if it has between two and five neighbors in state `1.' This…