BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Percolation on planar graphs and applications
DTSTART:20250528T160000
DTEND:20250528T173000
DTSTAMP:20260528T052259Z
UID:440f59a4578c1cc39e9e9746ff5e421fdf10d2f1f3dfe4278966f7df
CATEGORIES:Conferences - Seminars
DESCRIPTION:Alexander Glazman\n\nWe witness many phase transitions in ever
 yday life (eg. ice melting to water). The mathematical approach to these p
 henomena revolves around the percolation model: given a graph\, call each 
 vertex open with probability p independently of the others and look at the
  subgraph induced by open vertices. Benjamini and Schramm conjectured in 1
 996 that\, at p=1/2\, on any planar graph\, either there is no infinite co
 nnected components or infinitely many.\n\nWe prove a stronger version of t
 his conjecture and use this to establish fractal macroscopic behaviour in 
 the loop O(n) model. The latter includes a random discrete Lipschitz surfa
 ce as a particular case.\n\nJoint work with Matan Harel and Nathan Zelesko
 .
LOCATION:Math seminar room
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR