Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gilbert, N., Troitzsch, K.G.: Simulation for the social scientist. Buckingham (UK): Open University press (1999)
Serra, R., Villani, M., Salvemini, A.: Continuous genetic networks. Parallel Computing 27, (2001) 663–683
Kauffman, S.A.: Behavior of randomly constructed nets: binary element nets. In: C.H. Waddington (ed): Towards a theoretical biology. Vol. 3. Edinburgh University Press (1970)
Kauffman, S.A.: The origins of order. Oxford University Press (1993)
Serra, R., Zanarini, G.: Complex systems and cognitive properties. Springer-Verlag (1990)
Serra, R., Villani, M.: Modelling bacterial degradation of organic compounds with genetic networks. J. Theor. Biol. 189(1) (1997) 107–119
Watts, D.J.: Small worlds: the dynamics of networks between order and randomness. Princeton University press (1999)
Amaral, L.A.N., Scala, A., Barthelemy, M, Stanley, H.E.: Classes of small world networks. PNAS 97, (2000) 11149–11152
Reka, A., Barabasi, A.L.: Statistical mechanics of complex networks. arXiv:condmat /0106096v1 (2001)
Wagner, A., Fell, D.: The small world inside large metabolic networks. Tech. Rep. 00-07-041, Santa Fe Institute (2000)
Jeong, H. et al.: The large scale organization of metabolic networks. Nature 407, (2000) 651–654
Watts, D.J, Strogatz, S.H.: Collective dynamics of small world networks. Nature 393 (1998) 440
Barabasi, A.L., Albert, R.: Science 286, (1999) 509
Strogatz, S.H.: Exploring complex networks. Nature 410, (2001) 268–276
Toffoli T., Margolus N.: Cellular automata machines. MIT Press (1987)
Mitchell, M.: An introduction to genetic algorithms. MIT Press (1996)
Crutchfield, J.P., Mitchell, M.: The evolution of emergent computation. Proc. Natl. Acad.Sci. USA 92 (1995) 10742–10746
Wang, X.F., Chen, G.: Synchronization in scale-free dynamical networks: robustness and fragility. IEEE Trans. Circuits and Systems 49(1) (2002) 54–62
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Serra, R., Villani, M. (2002). Perturbing the Regular Topology of Cellular Automata: Implications for the Dynamics. In: Bandini, S., Chopard, B., Tomassini, M. (eds) Cellular Automata. ACRI 2002. Lecture Notes in Computer Science, vol 2493. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45830-1_16
Download citation
DOI: https://doi.org/10.1007/3-540-45830-1_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44304-9
Online ISBN: 978-3-540-45830-2
eBook Packages: Springer Book Archive