相关论文: Long-range memory elementary 1D cellular automata:…

I study the Chate-Manneville cellular automata rules on randomly connected lattices. The periodic and quasi-periodic macroscopic behaviours associated with these rules on finite-dimensional lattices persist on an infinite-dimensional…

We consider a continuous-space and continuous-time diffusion process under resetting with memory. A particle resets to a position chosen from its trajectory in the past according to a memory kernel. Depending on the form of the memory…

Cellular automata (CA) provide a minimal formalism for investigating how simple local interactions generate rich spatiotemporal behavior in domains as diverse as traffic flow, ecology, tissue morphogenesis and crystal growth. However,…

Time non-locality, or memory, is a non-equilibrium property shared by all physical systems. Here, we show that memory is sufficient to induce a phase of spatial long-range order (LRO) even if the system's primary dynamical variables are…

Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial…

We study periodically driven closed systems with a long-ranged Hamiltonian by considering a generalized Kitaev chain with pairing terms which decay with distance as a power law characterized by exponent $\alpha$. Starting from an initial…

When the game Lights Out is played according to an algorithm specifying the player's sequence of moves, it can be modeled using deterministic cellular automata. One such model reduces to the $\sigma$ automaton, which evolves according to…

Discrete dynamical systems can exhibit complex behaviour from the iterative application of straightforward local rules. A famous example are cellular automata whose global dynamics are notoriously challenging to analyze. To address this, we…

Biological systems are notorious for complex behavior within short timescales (e.g. metabolic activity) and longer time scales (e.g. evolutionary selection), along with their complex spatial organization. Because of their complexity and…

Every transitive cellular automaton (CA) is sensitive to initial conditions. We study this implication in the more general context of non-uniform cellular automata (NUCA) with finitely many different local update rules assigned to cells. We…

Exactly ergodicity in boundary-driven semi-infinite cellular automata (CA) are investigated. We establish all the ergodic rules in CA with 3, 4, and 5 states. We analytically prove the ergodicity for 12 rules in 3-state CA and 118320 rules…

How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…

The synapses of real neural systems seem to have delays. Therefore, it is worthwhile to analyze associative memory models with delayed synapses. Thus, a sequential associative memory model with delayed synapses is discussed, where a…

In dynamical systems such as cellular automata and iterated maps, it is often useful to look at a language or set of symbol sequences produced by the system. There are well-established classification schemes, such as the Chomsky hierarchy,…

In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information indefinitely is nontrivial, even in an infinite automaton. Still, there is a solution in 2…

In this paper, we explore relationships between two models of systems which are governed by only the local interactions of large collections of simple components: cellular automata (CA) and the abstract Tile Assembly Model (aTAM). While…

We study a two-dimensional cellular automaton (CA), called Diffusion Rule (DR), which exhibits diffusion-like dynamics of propagating patterns. In computational experiments we discover a wide range of mobile and stationary localizations…

The synchronization of two stochastically coupled one-dimensional cellular automata (CA) is analyzed. It is shown that the transition to synchronization is characterized by a dramatic increase of the statistical complexity of the patterns…

We investigate the critical behaviour of a probabilistic mixture of cellular automata (CA) rules 182 and 200 (in Wolfram's enumeration scheme) by mean-field analysis and Monte Carlo simulations. We found that as we switch off one CA and…

We introduce a stochastic cellular automaton with power law spatial decaying long-range interactions. In some limit this model reduces to the Domany-Kinzel cellular automaton. Monte Carlo and mean field calculations of the phase diagram of…