BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20250918T021059EDT-1156t5bErI@132.216.98.100
DTSTAMP:20250918T061059Z
DESCRIPTION:Probabilistic aspects of minimum spanning trees.\n\nOne of the 
 most dynamic areas of probability theory is the study of the behaviour of 
 discrete optimization problems on random inputs. My talk will focus on the
  probabilistic analysis of one of the first and foundational combinatorial
  optimization problems: the minimum spanning tree problem. The structure o
 f a random minimum spanning tree (MST) of a graph G turns out to be intima
 tely linked to the behaviour of critical and near-critical percolation on 
 G. I will describe this connection\, and present some results on the struc
 ture\, scaling limits\, and volume growth of random MSTs. It turns out tha
 t\, on high-dimensional graphs\, random minimum spanning trees are expecte
 d to be three-dimensional when viewed intrinsically\, and six-dimensional 
 when viewed as embedded objects.\n	Based on joint works with Nicolas Brouti
 n\, Christina Goldschmidt\, Simon Griffiths\, Ross Kang\, Gregory Miermont
 \, Bruce Reed\, Sanchayan Sen. \n
DTSTART:20170310T210000Z
DTEND:20170310T220000Z
LOCATION:Room 6254\, CA\, Pavillon André-Aisenstadt\, CA\, QC\, Montreal\, 
 2920\, Chemin de la tour\, 5th floor
SUMMARY:Louigi Addario-Berry\, 9IÖÆ×÷³§Ãâ·Ñ
URL:/channels/event/louigi-addario-berry-universite-mc
 gill-266725
END:VEVENT
END:VCALENDAR