BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Probability
SUMMARY:Large deviations in sparse random graphs - Anirban
  Basak (ICTS\, Tata Institute)
DTSTART;TZID=Europe/London:20260210T140000
DTEND;TZID=Europe/London:20260210T150000
UID:TALK244252AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/244252
DESCRIPTION:Classical large deviation theory provides sharp as
 ymptotics for probabilities of rare events involvi
 ng linear statistics of independent random variabl
 es. A natural nonlinear extension arises in the st
 udy of Erdős-Rényi graphs\, where one of the earli
 est and most tractable questions concerns large de
 viations of triangle counts. Over the past fifteen
  years\, this direction has led to substantial pro
 gress and new methods. In this talk\, I will descr
 ibe some of these developments\, focusing in parti
 cular on large deviations for subgraph counts in s
 parse Erdős-Rényi graphs and random regular graphs
 . Based on joint works with Riddhipratim Basu and 
 Shaibal Karmakar. 
LOCATION:MR12
CONTACT:Jason Miller
END:VEVENT
END:VCALENDAR