BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: We consider a simple model of a random temporal graph\, obtain
 ed by assigning to every edge of an Erdős–Rényi random graph G_n\,p a unifo
 rmly random presence time in the real interval [0\, 1]. We study several co
 nnectivity properties of this random temporal graph model and uncover a sur
 prisingly regular sequence of sharp thresholds at which these different lev
 els of connectivity are reached. Finally\, we discuss how our results can b
 e transferred to other random temporal graph models. Based on joint work wi
 th Arnaud Casteigts\, Michael Raskin\, and Viktor Zamaraev. 
DTSTAMP:20211123T181200
DTSTART:20211206T160000
CLASS:PUBLIC
LOCATION:Online via Zoom 
SEQUENCE:0
SUMMARY:Malte Renken (Technische Universität Berlin): Connectivity Threshol
 ds in Random Temporal Graphs
UID:107919893@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20211206-C-Ren
 ken.html
END:VEVENT
END:VCALENDAR