BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:7667@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20170106T110000
DTEND;TZID=Europe/Paris:20170106T120000
DTSTAMP:20241120T204751Z
URL:https://www.i2m.univ-amu.fr/evenements/scaling-limits-of-critical-rand
 om-graphs-nicolas-broutin/
SUMMARY:Nicolas Broutin (INRIA\, RAP team\, Rocquencourt ): Scaling limits 
 of critical random graphs - Nicolas Broutin
DESCRIPTION:Nicolas Broutin: For many models of random graphs\, as one incr
 eases the density of edges\, one usually observes a sudden change in struc
 ture at a critical density that depends on the model : precisely at that p
 oint\, a macroscopic ”giant com-ponent” containing a linear proportion
  of the nodes starts to emerge. The structure of the graph at the ”criti
 cal” point of the phase transition does not yet contain any macroscopic 
 component\, but many large ones at an intermediate scale\, that will quick
 ly merge into a single ”giant”. Understanding the phase transition and
  the structure of the ”critical” random graphs that one observes just 
 before the birth of the giant has since the first papers of Erdos and Reny
 i been one of the most fascinating topics in random graphs\, and more gene
 rally in models related to statistical physics. I will paint the big pictu
 re and to review some results about some results about scaling limits of s
 uch ”critical” random graphs\, in particular about their metric struct
 ure in some specific models such as the classical Erdos-Renyi random graph
 s\, but also inhomogeneous random graphs.\n\nhttps://who.rocq.inria.fr/Nic
 olas.Broutin/\n&nbsp\;
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 017/01/Nicolas_Broutin.jpg
CATEGORIES:Séminaire,Probabilités
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20161030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR