BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jan Grebík (University of Warwick)
DTSTART:20201123T140000Z
DTEND:20201123T150000Z
DTSTAMP:20260423T052451Z
UID:EPC/34
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/34/">Lar
 ge deviation principle for graphons</a>\nby Jan Grebík (University of War
 wick) as part of Extremal and probabilistic combinatorics webinar\n\n\nAbs
 tract\nIn this talk we discuss the large deviation principle (LDP) for a s
 equence of measures on the graphon space which is obtained by sampling fro
 m a fixed graphon W.\n\nThe large deviation theory for the Erdős–Rényi
  random graph (sampling from a constant graphon) and its applications were
  developed by Chatterjee and Varadhan.\n\nParticularly\, the Erdős–Rén
 yi random graph satisfies LDP with the speed $2/n^2$.\n\nWe show that when
  sampling from a general graphon one can get LDPs with two interesting spe
 eds\, namely\, $1/n$ and $2/n^2$. We completely characterize the situation
  for the speed $1/n$. In the case $2/n^2$\, we describe the LDP when sampl
 ing from a step graphon.\n\nTime permitting\, we compare our work with a r
 ecent result by Borgs\, Chayes\, Gaudio\, Petti and Sen on LDP for block m
 odels.\n\nThis is a joint work with O.Pikhurko.\n
LOCATION:https://researchseminars.org/talk/EPC/34/
END:VEVENT
END:VCALENDAR