BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Connectivity Thresholds for graphs with a fixed degree sequence
DTSTART;VALUE=DATE-TIME:20190502T123000Z
DTEND;VALUE=DATE-TIME:20190502T133000Z
DTSTAMP;VALUE=DATE-TIME:20191024T014051Z
UID:indico-event-4437@indico.math.cnrs.fr
DESCRIPTION:We consider the probability space of random graphs with a fixe
d degree sequence\n(the degree of a vertex in a graph is the number of edg
es incident to it\; the degree sequence\nspecifies the degree of each vert
ex). We characterize for which degree sequences a uniformly\nrandom graph
with the given degree sequence has a giant component (a component with a\n
constant fraction of the vertices) almost surely. (Joint with Joos\, Raute
nbach\, and Perarnau.)\n\nhttps://indico.math.cnrs.fr/event/4437/
LOCATION:ENS\, UMPAs salle 435
URL:https://indico.math.cnrs.fr/event/4437/
END:VEVENT
END:VCALENDAR