Title:
Large deviations in random graphs
Large deviations in random graphs
No Thumbnail Available
Author(s)
Zhao, Yufei
Advisor(s)
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
What is the probability that the number of triangles in an Erd\H{o}s–R\'enyi random graph exceeds its mean by a constant factor?
This problem has been a useful litmus test for concentration bound techniques. Even the order of the log-probability was considered a difficult problem until its resolution a few years ago by Chatterjee and DeMarco--Kahn. I will discuss the problem of determining the exponential rate of the tail probability, and survey some recent developments and open problems.
Sponsor
Date Issued
2018-05-14
Extent
39:30 minutes
Resource Type
Moving Image
Resource Subtype
Lecture