Abstract
In the simulations of the previous chapter we kept the temperature constant, and thus the energy fluctuated in the “canonical ensemble”. Now we deal with “micro-canonical” alternatives which keep the energy constant and thus have a fluctuating temperature. This method gives us an opportunity to introduce deterministic cellular automata. Those are lattices where each site k carries an integer variable S k , called a spin, which has a limited number of values it can take. We let it be either -1 or +1 (or 0 and 1). The time t proceeds in steps of one and thus is also an integer. For time t + 1 the spin at site k gets a value determined uniquely from the spin values of its neighbors at time t, and in some models also from its own orientation S k (t) at time t. For example, on an L*L square lattice with nearest neighbors k - 1, k + 1, k - L and k + L of site k (see Introduction), deterministic cellular automata are defined by the rule
.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Stauffer, D., Hehl, F.W., Ito, N., Winkelmann, V., Zabolitzky, J.G. (1993). Cellular Automata (Q2R and Creutz). In: Computer Simulation and Computer Algebra. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78117-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-78117-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56530-7
Online ISBN: 978-3-642-78117-9
eBook Packages: Springer Book Archive