Abstract
Start by randomly populating each site of the two-dimensional integer lattice with any one of N types, labeled 0, 1,... ,N-1 (N ≥ 3). The type ζ(y) at site y can eat the type ζ(x) at neighboring site x (i.e., replace the type at x with ζ(y)) provided that ζ(y) — ζ(x) = 1 mod iV. We describe the dynamics of cyclic cellular automata (c.c.a.) ζt , discrete-time deterministic systems which follow the rule:
(●) At any time t, each type ζt(y) eats every neighboring type that it can.
These systems have remarkably complex dynamics. As N becomes large they display a curious metastability leading to large-scale locally-periodic structure. This article contains a preliminary account of our findings. For the most part, we rely on computations and computer graphics produced by the Cellular Automaton Machine. However we are able to give a simple proof that the infinite system ζt is asymptotically locally periodic for any N > ∞. Moreover, we identify a number of regularity properties of rule (●), mostly topological in nature, that offer some hope for a more detailed rigorous analysis.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aizenman, M. and Lebowitz, J., Metastability effects in bootstrap percolation, J. Phys. A: Math. Gen. 21 (1988), pp. 3801–3813.
Bramson, M. and Griffeath, D., Flux and fixation in cyclic particle systems, Annals of Probability 17 (1989), pp. 26–45.
Dewdney, A.K., Computer Recreations, Scientific American August (1988), pp. 104–107.
Dewdney, A.K., Computer Recreations, Scientific American August (1989), pp. 102–105.
Fisch, R., The one-dimensional cyclic cellular automaton: a system with deterministic dynamics which emulates an interacting particle system with stochastic dynamics, J. Theoretical Probability 3 (1990), pp. 311–338.
Fisch, R., Clustering in the one-dimensional 3-color cyclic cellular automaton, Ann. Probab. (1989) (to appear).
Fisch, R., Gravner, J. and Griffeath, D., Threshold-range scaling of excitable cellular automata, Statistics and Computing (to appear).
Griffeath, D., Cyclic random competition: a case history in experimental mathematics, In “Computers and Mathematics,” J. Bar-wise, A.M.S. Notices December (1988), pp. 1472–1480.
Harris, T.E., Diffusion with “collisions” between particles, J. Appl. Probability 2 (1965), pp. 323–338.
Moe, G.K., Rheinboldt, W.C. and Abildskov, J.A., A computer model of atrial fibrillation, American Heart J. 67 (1964), pp. 200–220.
Packard, N. and Wolfram, S., Two-dimensional cellular automata, J. Stat. Phys. 38 (1985), pp. 901–946.
Toffoli, T. and Margolus, N., “Cellular Automata Machines,” M.I.T. Press, Cambridge, Massachusetts, 1987.
Winfree, A.T., Rotating chemical reactions, Scientific American 230 June (1974), pp. 82–95.
Winfree, A.T. and Strogatz, S.H., Organizing centres for three-dimensional chemical waves, Nature 311 no. 5987 (1984), pp. 611–615.
Winfree, A.T., Winfree, E.M. and Seifert, H., Organizing centers in a cellular excitable medium, Physica 17D (1985), pp. 109–115.
Wolfram, S., Universality and complexity in cellular automata., Physica 10D (1985), pp. 1–35.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Fisch, R., Gravner, J., Griffeath, D. (1991). Cyclic Cellular Automata in Two Dimensions. In: Alexander, K.S., Watkins, J.C. (eds) Spatial Stochastic Processes. Progress in Probability, vol 19. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0451-0_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0451-0_8
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6766-9
Online ISBN: 978-1-4612-0451-0
eBook Packages: Springer Book Archive