Network questions in lilypond protocol models
by Professor Daryl Daley
Abstract: The germ-grain model for lilypond leaves has spawned a variety of models in other geometric settings. The simplest entails Poisson distributed points (`germs') on the line, and it leads to algebraically tractable answers to a range of questions. Most questions in other settings are amenable to solution only via simulation or sometimes via inequalities. The talk uses `classic' models in 1, 2 and 3-D, and grains that are finite line-segments in the plane, to illustrate the discussion.
Explicit constructions describe the growth of grains about the germs as centres until the growth is stopped by contact of the growing grain with another which in turn may have already stopped or may indeed keep growing. The resulting model can be described algebraically, which enables us to address the basic question of whether or not there exists an infinite `chain' of touching grains; call the existence of such `percolation'. When does a given model percolate? If it does not, what is the size of the finite clusters, and how much overlap (Penrose's `jumping frogs') results in percolation? What is the grain-size distribution? What is the distribution of the number of grains touching a given grain? What is the role of the Poisson distribution? What is the role of different granular shapes? Are there properties that persist across finite dimensions?
For More Information: contact: Prof Daniel Dufresne. email firstname.lastname@example.org OR Dr Aihua Xia. email email@example.com