Related papers: Randomly connected cellular automata: A search for…
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…
This study introduces Skewed Fully Asynchronous Cellular Automata (SACA), a novel update scheme in cellular automata that updates the states of only two consecutive and adjacent cells, such as ci and ci+1, simultaneously at each time step.…
We derive the critical behavior of a CA traffic flow model using an order parameter breaking the symmetry of the jam-free phase. Random braking appears to be the symmetry-breaking field conjugate to the order parameter. For $v_{\max}=2$, we…
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of the central cell will follow a given evolution, by…
In neural circuits, statistical connectivity rules strongly depend on neuronal type. Here we study dynamics of neural networks with cell-type specific connectivity by extending the dynamic mean field method, and find that these networks…
A network of $n$ wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power $P$ or remain silent. The objective is to maximize the number of…
Bosons interacting repulsively on a lattice with a flat lowest band energy dispersion may, at sufficiently small filling factors, enter into a Wigner-crystal-like phase. This phase is a consequence of the dispersionless nature of the…
We investigate cellular automata where some global quantity varies periodically or quasiperiodically with time. We find that these systems are highly predictable, and can be rather well described by a set of mean-field variables. We…
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global optimization; however,…
While the reversibility of multidimensional cellular automata is undecidable and there exists a criterion for determining if a multidimensional linear cellular automaton is reversible, there are only a few results about the reversibility…
A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…
We explore some aspects of phase transitions in cellular automata. We start recalling the standard formulation of statistical mechanics of discrete systems (Ising model), illustrating the Monte Carlo approach as Markov chains and stochastic…
Individual cellular automata rules are attractive models for a range of biological and physical self-assembling systems. While coexpression and coevolution are common in such systems, ensembles of cellular automata rules remain poorly…
In mathematics and engineering, control theory is concerned with the analysis of dynamical systems through the application of suitable control inputs. One of the prominent problems in control theory is controllability which concerns the…
We study spontaneous symmetry breaking in a system of spinless fermions in the Honeycomb lattice paying special emphasis to the role of an enlarged unit cell on time reversal symmetry broken phases. We use a tight binding model with nearest…
We study the dynamics of a collection of nonlinearly coupled limit cycle oscillators, relevant to systems ranging from neuronal populations to electrical circuits, under coupling topologies varying from a regular ring to a random network.…
We show that a behaviour analogous to degenerate hyperbolicity can occur in nearest-neighbour cellular automata (CA) with three states. We construct a 3-state rule by "lifting" elementary CA rule 140. Such "lifted" rule is equivalent to…
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular automata drastically changed under…
We study correlations in fermionic lattice systems with long-range interactions in thermal equilibrium. We prove a bound on the correlation decay between anti-commuting operators and generalize a long-range Lieb-Robinson type bound. Our…
Invertible cellular automata are useful as models of physical systems with microscopically revesible dyanmics. There are several well-understood ways to construct them: partitioning rules, second-order rules, and alternating-grid rules. We…