A Cellular Automaton

Rinaldo B. Schinazi
Additional contact information
Rinaldo B. Schinazi: University of Colorado, Department of Mathematics

Chapter V in Classical and Spatial Stochastic Processes, 1999, pp 127-134 from Springer

Abstract: Abstract What is in this chapter? Cellular automata are widely used models in mathematical physics and in theoretical biology. These systems start from a random state and then evolve using deterministic rules, with time being discrete. We concentrate on a specific model in this chapter. We define the initial configuration as follows. For each site in Z 2 we put a 1 with probability p or a 0 with probability 1 — p. This is done independently for each site. The rules of evolution for the cellular automaton are the following. If there is 1 at a site it remains there forever. If there is a 0 at a given site and if at least one neighbor in each of the orthogonal directions is a 1 then we replace the 0 by a 1 at the next update.

Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-1582-0_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461215820

DOI: 10.1007/978-1-4612-1582-0_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().