![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Anirban Basak (ICTS, Tata Institute)
Tuesday 10 February 2026, 14:00-15:00
Large deviations in sparse random graphs
- 👤 Speaker: Anirban Basak (ICTS, Tata Institute)
- 📅 Date & Time: Tuesday 10 February 2026, 14:00 - 15:00
- 📍 Venue: MR12
Abstract
Classical large deviation theory provides sharp asymptotics for probabilities of rare events involving linear statistics of independent random variables. A natural nonlinear extension arises in the study of Erdős-Rényi graphs, where one of the earliest and most tractable questions concerns large deviations of triangle counts. Over the past fifteen years, this direction has led to substantial progress and new methods. In this talk, I will describe some of these developments, focusing in particular on large deviations for subgraph counts in sparse Erdős-Rényi graphs and random regular graphs. Based on joint works with Riddhipratim Basu and Shaibal Karmakar.
Series This talk is part of the Probability series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- Hanchen DaDaDash
- Interested Talks
- MR12
- Probability
- School of Physical Sciences
- Statistical Laboratory info aggregator
Note: Ex-directory lists are not shown.