BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Wojciech Samotij (Tel Aviv University) DTSTART:20200618T070000Z DTEND:20200618T080000Z DTSTAMP:20260423T035024Z UID:SCMSComb/3 DESCRIPTION:Title: Large deviations of triangle counts in the binomial random graph II\n by Wojciech Samotij (Tel Aviv University) as part of SCMS Combinatorics Se minar\n\n\nAbstract\nSuppose that $Y_1\, \\ldots \, Y_N$ are i.i.d. (indep endent identically distributed) random variables and let $X = Y_1 + … + Y_N$. The classical theory of large deviations allows one to accurately es timate the probability of the tail events $X < (1-c)E[X]$ and $X > (1+c)E[ X]$ for any positive $c$. However\, the methods involved strongly rely on the fact that X is a linear function of the independent variables $Y_1\, …\, Y_N.$ There has been considerable interest—both theoretical and pr actical—in developing tools for estimating such tail probabilities also when $X$ is a nonlinear function of the $Y_i$. One archetypal example stud ied by both the combinatorics and the probability communities is when $X$ is the number of triangles in the binomial random graph $G(n\,p)$.\n\nTalk II: We will present a complete solution to the upper tail problem for tri angle counts in $G(n\,p)$ that was obtained recently in a joint work with Matan Harel and Frank Mousset.\n\nPassword 061801\n LOCATION:https://researchseminars.org/talk/SCMSComb/3/ END:VEVENT END:VCALENDAR