SearcharxivSearch

arXiv · 1803.09836

Kauffman cellular automata on quasicrystal topology

Abstract

In this paper we perform numerical simulations to study Kauffman cellular automata (KCA) on quasiperiod lattices. In particular, we investigate phase transition, magnetic entropy and propagation speed of the damage on these lattices. Both the critical threshold parameter $p_{c}$ and the critical exponents are estimated with good precision. In order to investigate the increase of statistical fluctuations and the onset of chaos in the critical region of the model, we have also defined a magnetic entropy to these systems. It is seen that the magnetic entropy behaves in a different way when one passes from the frozen regime ($p p_{c}$). For a further analysis, the robustness of the propagation of failures is checked by introducing a quenched site dilution probability $q$ on the lattices. It is seen that the damage spreading is quite sensitive when a small fraction of the lattice sites are disconnected. A finite-size scaling analysis is employed to estimate the critical exponents. From these numerical estimates, we claim that on both pure ($q=0$) and diluted ($q=0.05$) quasiperiodic lattices, the KCA model belongs to the same universality class than on square lattices. Furthermore, with the aim of comparing the dynamical behavior between periodic and quasiperiodic systems, the propagation speed of the damage is also calculated for the square lattice assuming the same conditions. It is found that on square lattices the propagation speed of the damage obeys a power law as $v\sim (p-p_{c})^α$, whereas on quasiperiod lattices it follows a logarithmic law as $v \sim \ln(p-p_{c})^α$.

Explore related subjects

Keep this discovery

BibTeXRIS

Carlos Handrey A. Ferraz, José Luiz S. Lima. 2018-06-27. Kauffman cellular automata on quasicrystal topology. https://doi.org/10.1007/s13538-018-0588-2

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Optical free space extreme learning machine for the implementation of emergent complex systems

Cellular automata conform a set of computational models which evolve with a reduced set of simple rules, yet still are able to show extremely complex emergent phenomena such as fractals and universal computation. Despite their apparent simplicity, they have shown great potential in simulating natural systems and solving challenging computational tasks such as classification and image generation. Instead of implementing cellular automata purely at the software level, it is desirable to design novel analog computing platforms that physically evolve following the automata's underlying rules, thereby reducing power requirements and latency. Here, we introduce an optical extreme learning machine for the simulation of a wide range of cellular automata. Our system operates in free space, and uses a spatial light modulator to encode the evolution rules of the system, while coherent wave propagation performs the corresponding computations. Our results demonstrate a simple, fully-programmable, cost and power efficient, and easy to build and align platform for the implementation of a wide range of complex computational systems such as elementary cellular automata, Conway's Game of Life, and two-dimensional Turing machines.

nlin.CG

The istr-graph: Interactive Visualisation of any Classic-Graph in DDLab

Any type of attractor basin (classic-graph) created in DDLab can now be visualised, manipulated, and deconstructed as a drag/drop ``interactive state transition graph'' (istr-graph). The new istr-graph applies to subtrees, single basins, the basin of attraction field, compression, and all other classic-graph parameters. This is an important update on the pre-existing ``interactive basin of attraction field graph'' (ibaf-graph) specific to just the complete uncompressed field, but the ibaf-graph is nevertheless retained for some of its unique attributes. These issues are discussed with a focus on the scope and implementation of the new istr-graph.

nlin.CG

Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics

I explore Conway's Game of Life (GoL) on six composite Archimedean lattices. On the Kagome lattice, on which small gliders and puffers appear particularly frequently across inputs, I use the output of a symmetry-constrained evolutionary search algorithm to construct a novel glider gun. The glider gun comprises four interacting bouncers and stably emits a small glider every 276th generation. Serving as an extension of classical GoL, I also propose cells with a phase degree of freedom and an associated local phase rule, which on the Kagome lattice is demonstrated to host phase-periodic gliders. This enables the possibility of phase-sensitive and interference-based computations.

nlin.CG