Event Detail

Event Type: 
Department Colloquium
Date/Time: 
Monday, May 24, 2010 - 09:00
Location: 
Kidder 350 (tea in 302)

Speaker Info

Institution: 
University of California, Berkeley
Abstract: 

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 Bing map routes suggests challenging new
problems in the plane.