Four state deterministic cellular automaton rule emulating random diffusion
arXiv:2312.11377 · doi:10.1007/978-3-031-14926-9_13
Abstract
We show how to construct a deterministic nearest-neighbour cellular automaton (CA) with four states which emulates diffusion on a one-dimensional lattice. The pseudo-random numbers needed for directing random walkers in the diffusion process are generated with the help of rule 30. This CA produces density profiles which agree very well with solutions of the diffusion equation, and we discuss this agreement for two different boundary and initial conditions. We also show how our construction can be generalized to higher dimensions.
11 pages, 5 figures. Video demo at http://hdl.handle.net/10464/18210 , files defining the 2D rule in golly .rule format at http://hdl.handle.net/10464/18209