Related papers: Randomly connected cellular automata: A search for…
Cellular automata generate spatially extended, temporally persistent emergent structures from local update rules. No general method derives the mechanisms of that generation from the rule itself; existing tools reconstruct structure from…
Two-dimensional $CP^{N-1}$ models are investigated by Monte Carlo methods on the lattice, for values of $N$ ranging from 2 to 21. Scaling and rotation invariance are studied by comparing different definitions of correlation length $\xi$.…
While classical spin systems in random networks have been intensively studied, much less is known about quantum magnets in random graphs. Here, we investigate interacting quantum spins on small-world networks, building on mean-field theory…
Bethe approximation is shown to violate Bravais lattices translational invariance. A new scheme is then presented which goes over the one-site Weiss model yet preserving initial lattice symmetry. A mapping to a one-dimensional finite closed…
A model of $s$ interacting species is considered with two types of dynamical variables. The fast variables are the populations of the species and slow variables the links of a directed graph that defines the catalytic interactions among…
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number…
We introduce a pair of time-reversible models defined on the discrete space-time lattice with 3 states per site, specifically, a vacancy and a particle of two flavours (species). The local update rules reproduce the rule 54 reversible…
In a recent work, mean-field analysis and computer simulations were employed to analyze critical self-organization in networks of excitable cellular automata where randomly chosen synapses in the network were depressed after each spike (the…
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…
In order to characterize landslide frequency-size distributions and individuate hazard scenarios and their possible precursors, we investigate a cellular automaton where the effects of a finite driving rate and the anisotropy are taken into…
Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws.…
We consider discrete and integer-valued cellular automata (CA). A particular class of which comprises "Hamiltonian CA" with equations of motion that bear similarities to Hamilton's equations, while they present discrete updating rules. The…
Using lattice QCD we study the spectrum of low-lying fermion eigenmodes. According to the Banks-Casher relation, accumulation of the low-mode is responsible for the spontaneous breaking of chiral symmetry in the QCD vacuum. On the lattice…
In this paper we are concerned with contact processes with random edge weights on rooted regular trees. We assign i.i.d weights on each edge on the tree and assume that an infected vertex infects its healthy neighbor at rate proportional to…
A simple one-dimensional cellular automaton model with threshold dynamics is introduced. The cumulative distribution of the size of the relaxations is analytically computed and behaves as a power law with an exponent equal to -1. This…
Living systems operate in a critical dynamical regime -- between order and chaos -- where they are both resilient to perturbation, and flexible enough to evolve. To characterize such critical dynamics, the established 'structural theory' of…
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
A necessary and sufficient condition for a one-dimensional q-state n-input cellular automaton rule to be number-conserving is established. Two different forms of simpler and more visual representations of these rules are given, and their…
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…
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…