Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
An introduction to genetic algorithms
An introduction to genetic algorithms
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Parallel Computing - Special issue on cellular automata: from modeling to applications
Simulation for the Social Scientist
Simulation for the Social Scientist
Complex Systems and Cognitive Processes
Complex Systems and Cognitive Processes
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Scale-Free automata networks are not robust in a collective computational task
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
| Hi-index | 0.00 |
The topology of Cellular Automata (CA) is that of regular graphs with high clustering coefficients and long characteristic path lengths. The introduction of some long range connections modifies the topology, and it may give rise to small world networks, with high clustering and short path lengths, modifying also the system dynamical properties (attractors, basins of attraction, transient duration). In order to investigate the effects on the dynamics of the introduction of long range connections it is appropriate to keep the number of connections per node constant, while the existing algorithms give rise to nodes with different connectivities. Here we present an algorithm able to re-direct the links without changing the connectivity degree of the nodes. We then analyze the effects of small topological perturbations of a regular lattice upon the system dynamical properties in the case where the transition function is the majority rule; we show that these effects are indeed important and discuss their characteristics.