BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260601T162620EDT-88471X1PFZ@132.216.98.100
DTSTAMP:20260601T202620Z
DESCRIPTION:Title: Increasing paths in random temporal graphs\n\nAbstract: 
 We consider a version of the classical Erdős–Rényi random graph G(n\,p) wh
 ere each edge has a distinct random time stamp\, and connectivity is const
 rained to sequences of edges with increasing time stamps. We study the len
 gths of increasing paths: the lengths of the shortest and longest paths be
 tween typical vertices\, the maxima of these lengths from a given vertex\,
  as well as the maxima between any two vertices\; this covers the (tempora
 l) diameter.\n	\n	This talk is based on joint work with Nicolas Broutin and 
 Nina Kamčev.\n\nZoom link: https://mcgill.zoom.us/j/88913958273?pwd=cDBIWG
 F3bmZSUmRzMFdLNGR3V2FXUT09\n
DTSTART:20230922T140000Z
DTEND:20230922T150000Z
LOCATION:Room 1214\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue
  Sherbrooke Ouest
SUMMARY:Gabor Lugosi (Pompeu Fabra)
URL:/mathstat/channels/event/gabor-lugosi-pompeu-fabra
 -351079
END:VEVENT
END:VCALENDAR