MATH Seminar

Title: Coordinate Percolation
Colloquium: Combinatorics
Speaker: Peter Winkler of Dartmouth College
Contact: Dwight Duffus, dwight@mathcs.emory.edu
Date: 2011-03-28 at 4:00PM
Venue: MSC W201
Download Flyer
Abstract: Percolation is the study of random subgraphs of a graph. In coordinate percolation, the big graph is a grid of some kind, and inclusion of a vertex depends on random values associated with the lines that cross there. Coordinate percolation arises in scheduling problems (in contrast to independent percolation, intended originally as a model for porous material).\\ \\ We'll consider several examples, including one that is notoriously difficult, and another that becomes miraculously easy when (with Lizz Moseman, NIST) combinatorial methods are applied.