BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:3b5ef7e7-eb5a-45f5-81ea-8bd058dbf801
X-WR-CALNAME:GT AlgoDist\, «Giant Components in Random Temporal Graphs»\, M
 ichael Raskin
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20261025T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
RDATE:20260329T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:3b5ef7e7-eb5a-45f5-81ea-8bd058dbf801
DTSTAMP:20260409T155430Z
CLASS:PUBLIC
DESCRIPTION:Michael Raskin (LaBRI)\n\nTitle: Giant Components in Random Tem
 poral Graphs\n\nAbstract:\n\nA temporal graph is a graph whose edges appea
 r only at certain points in time.  Recently\, a natural temporal analog of
  the Erdős-Rényi random graph model has been introduced. The proposed mod
 el is obtained by randomly permuting the edges of an Erdős-Rényi random g
 raph and interpreting this permutation as an ordering of presence times. I
 t was shown that the connectivity threshold in the Erdős-Rényi model fans
  out into multiple phase transitions for several distinct notions of reach
 ability in the temporal setting.\n\n        In the present paper\, we iden
 tify a sharp threshold for the emergence of a giant temporally connected c
 omponent. We show that at p = log n/n the size of the largest temporally c
 onnected component increases from o(n) to n-o(n). This threshold holds for
  both open and closed connected components\, i.e. components that allow\, 
 respectively forbid\, their connecting paths to use external nodes.\n\n\n
 \nhttps://algodist.labri.fr/index.php/Main/GT
DTSTART;TZID=Europe/Paris:20241023T110000
DTEND;TZID=Europe/Paris:20241023T120000
LOCATION:LaBRI salle 178 - lien visio https://webconf.u-bordeaux.fr/b/arn-4
 tr-7gp
SEQUENCE:0
SUMMARY:GT AlgoDist\, «Giant Components in Random Temporal Graphs»\, Michae
 l Raskin
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
