|Date: Tuesday, November 21, 2006
Title: Submodular Percolation
Abstract: Scheduling sequences of reals to minimize their maximum sum leads naturally to a partial order on real words called the "worm order". It turns out that in any submodular system there is a maximal chain which is minimum in the worm order among all paths from 0 to 1; this results in conditions under which a process can be scheduled without taking backward steps, and also permits the analysis of a form of coordinate percolation.
Joint work in part with Graham Brightwell (LSE) and in part with Lizz Moseman (Dartmouth).
Speaker: Peter Winkler