BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20250330T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260424T221331Z
UID:680b716587741291026470@ist.ac.at
DTSTART:20250428T170000
DTEND:20250428T181500
DESCRIPTION:Speaker: Alexander Glazman\nhosted by Laszlo Erdös\, Jan Maas\
 nAbstract: We witness many phase transitions in everyday life (eg. ice mel
 ting to water). The mathematical approach to these phenomena revolves arou
 nd the percolation model: given a graph\, call each vertex open with proba
 bility p independently of the others and look at the subgraph induced by o
 pen vertices. Benjamini and Schramm conjectured in 1996 that\, at p=1/2\, 
 on any planar graph\, either there is no infinite connected components or 
 infinitely many.We prove a stronger version of this conjecture and use thi
 s to establish fractal macroscopic behaviour in the loop O(n) model. The l
 atter includes a random discrete Lipschitz surface as a particular case.Jo
 int work with Matan Harel and Nathan Zelesko.
LOCATION:Central Bldg / O1 / Mondi 2a (I01.O1.008)\, ISTA
ORGANIZER:boosthui@ist.ac.at
SUMMARY:Alexander Glazman: Benjamini-Schramm conjecture and the loop O(n) m
 odel
URL:https://talks-calendar.ista.ac.at/events/5735
END:VEVENT
END:VCALENDAR