BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Pierre-Loïc Méliot (Orsay)
DTSTART:20210528T130000Z
DTEND:20210528T140000Z
DTSTAMP:20260423T003243Z
UID:WCS/29
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/29/">Dep
 endency graphs\, upper bounds on cumulants and singular graphons</a>\nby P
 ierre-Loïc Méliot (Orsay) as part of Warwick Combinatorics Seminar\n\n\n
 Abstract\nConsider a sum of random variables $S = \\sum_{v \\in V} A_v$. I
 f the variables $A_v$ are weakly dependent\, then it is well known that un
 der mild assumptions\, the distribution of $S$ is close to a normal distri
 bution. The theory of dependency graphs enables one to make this statement
  precise. In this framework\, we shall present new bounds on the cumulants
  of $S$\, which enable one to have a combinatorial approach of this probab
 ilistic results. One of the main application is the study of the fluctuati
 ons of the densities of subgraphs in a random graph chosen according to a 
 graphon model. We shall see that two behavior are possible\, according to 
 whether the graphon is generic or singular. In the latter case\, the limit
 ing distributions that appear are non-Gaussian.\n
LOCATION:https://researchseminars.org/talk/WCS/29/
END:VEVENT
END:VCALENDAR