Exchangeability and Continuum Limits of Discrete Random Structures
Speaker: David Aldous, U.C. Berkeley
Location: Warren Weaver Hall 1302
Date: Monday, February 8, 2010, 3:45 p.m.
Exchangeable representations of complex random structures are useful in several ways, in particular providing a moderately general way to derive continuum limits of discrete random structures. I shall give an old example (continuum random trees) and a newer example (dense graph limits). Thinking this way about Google map routes suggests challenging new problems in the plane.
Paper available at: http://front.math.ucdavis.edu/0909.4339