Gravner, Janko; Griffeath, David Modeling snow crystal growth. I: Rigorous results for Packard’s digital snowflakes. (English) Zbl 1122.37057 Exp. Math. 15, No. 4, 421-444 (2006). Summary: Digital snowflakes are solidifying cellular automata on the triangular lattice with the property that a site having exactly one occupied neighbor always becomes occupied at the next time step. We demonstrate that each such rule fills the lattice with an asymptotic density that is independent of the initial finite set. There are some cases in which this density can be computed exactly, and others in which it can only be approximated. We also characterize when the final occupied set comes within a uniformly bounded distance of every lattice point. Other issues addressed include macroscopic dynamics and exact solvability. Cited in 1 ReviewCited in 4 Documents MSC: 37B15 Dynamical aspects of cellular automata 68Q80 Cellular automata (computational aspects) 82C20 Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics 62E20 Asymptotic distribution theory in statistics 11B05 Density, gaps, topology 28A80 Fractals Keywords:asymptotic density; cellular automata; exact solvability; growth model; macroscopic dynamics; thickness; triangular lattice; Packard’s snowflake automata × Cite Format Result Cite Review PDF Full Text: DOI Euclid EuDML