BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Nicholas Cook (Duke)
DTSTART:20210611T130000Z
DTEND:20210611T140000Z
DTSTAMP:20260423T003252Z
UID:WCS/32
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/32/">Reg
 ularity method and large deviation principles for the Erdős–Rényi hype
 rgraph</a>\nby Nicholas Cook (Duke) as part of Warwick Combinatorics Semin
 ar\n\n\nAbstract\nIn recent years there has been intense activity on the p
 roblem of estimating the upper tail for counts of a fixed subgraph in a sp
 arse Erdős–Rényi graph\, combining tools and perspectives from diverse
  areas such as extremal graph theory\, statistical physics\, stochastic an
 alysis and spectral theory. I will discuss some recent extensions of these
  results to the hypergraph setting. Our approach rests on new decompositio
 n theorems and counting lemmas for sparse Bernoulli tensors\, extending cl
 assic results from the regularity method for dense graphs. These results a
 re formulated in terms of a new class of cut-type norms specially tailored
  for the sparse setting. Based on joint work with Amir Dembo and Huy Tuan 
 Pham.\n
LOCATION:https://researchseminars.org/talk/WCS/32/
END:VEVENT
END:VCALENDAR