Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6425194 | Advances in Mathematics | 2016 | 55 Pages |
Abstract
We present a general technique for computing large deviations of nonlinear functions of independent Bernoulli random variables. The method is applied to compute the large deviation rate functions for subgraph counts in sparse random graphs. Previous technology, based on Szemerédi's regularity lemma, works only for dense graphs. Applications are also made to exponential random graphs and three-term arithmetic progressions in random sets of integers.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)
Authors
Sourav Chatterjee, Amir Dembo,