DIGITAL SNOWFLAKES
Date
-
Topic
Several mathematical models of snow crystal growth will be
discussed. For a popular class of cellular automata known as Packard's Snowflakes, one can develop a fairly complete rigorous theory, addressing limiting density, fractal shapes and exact solvability. The bulk of this theory is limited to the deterministic cases, altough something can be said about random perturbations. The talk will also address a more realistic mesoscopic snowflake model, which offers some hope of at least empirical analysis. This talk will be accessible to most undergraduates and is on joint work with David Griffeath (Univ. of Wisconsin).
discussed. For a popular class of cellular automata known as Packard's Snowflakes, one can develop a fairly complete rigorous theory, addressing limiting density, fractal shapes and exact solvability. The bulk of this theory is limited to the deterministic cases, altough something can be said about random perturbations. The talk will also address a more realistic mesoscopic snowflake model, which offers some hope of at least empirical analysis. This talk will be accessible to most undergraduates and is on joint work with David Griffeath (Univ. of Wisconsin).
Speakers
Additional Information
Probability Seminar 2006
Janko Gravner (University of California, Davis)
