BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Embeddings\, entanglement\, and percolation - Geoffrey Grimmett (C
 ambridge)
DTSTART:20100216T163000Z
DTEND:20100216T173000Z
UID:TALK22465@talks.cam.ac.uk
CONTACT:Berestycki
DESCRIPTION:Can there exist a monotone embedding of one infinite random wo
 rd inside another\, with bounded gaps? What can be said about the critical
  point for the existence of an infinite `entangled' set of open edges in t
 he percolation model on the cubic lattice? These two questions are connect
 ed through a new type of percolation process\, called `Lipschitz percolati
 on'. It will be shown how to embed higher-dimensional words\, and to obtai
 n the best (so far) lower bound for the entanglement critical point. 
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR