Fetching the paper…
Reading the bibliography…
The upper tail problem in the Erd\H{o}s--R\'enyi random graph $G\sim\mathcal{G}_{n,p}$ asks to estimate the probability that the number of copies of a graph $H$ in $G$ exceeds its expectation by a factor $1+\delta$.
H. Finner, A generalization of Hölder’s inequality and some probability inequalities , Ann. Probab. 20
1901
Earlier work this paper cites.
H. J. Brascamp and E. H. Lieb, Best constants in Young’s inequality, its converse, and its generalization to more than three functions , Advances in Math. 20
1976
Earlier work this paper cites.
L. Lovász and M. D. Plummer, Matching theory , North-Holland Mathematics Studies, vol. 121, North-Holland Publishing Co., Amsterdam, 1986, Annals of Discrete Mathematics, 29
1986
Earlier work this paper cites.
S. Janson, T. Łuczak, and A. Rucinski, Random graphs , Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000
2000
Earlier work this paper cites.
B. Bollobás, Random graphs , second ed., Cambridge Studies in Advanced Mathematics, vol. 73, Cambridge University Press, Cambridge, 2001
2001
Earlier work this paper cites.
V. H. Vu, A large deviation result on the number of small subgraphs of a random graph , Combin. Probab. Comput. 10
2001
Earlier work this paper cites.
S. Janson and A. Ruciński, The infamous upper tail , Random Structures Algorithms 20
2002
Earlier work this paper cites.
J. I. Brown, C. A. Hickman, and R. J. Nowakowski, The independence fractal of a graph , J. Combin. Theory Ser. B 87
2003
Earlier work this paper cites.
S. Janson, K. Oleszkiewicz, and A. Ruciński, Upper tails for subgraph counts in random graphs , Israel J. Math. 142
2004
Earlier work this paper cites.
S. Janson and A. Ruciński, The deletion method for upper tail estimates , Combinatorica 24
2004
Cited alongside, same era.
J. H. Kim and V. H. Vu, Divide and conquer martingales and the number of triangles in a random graph , Random Structures Algorithms 24
2004
Cited alongside, same era.
J. I. Brown and R. J. Nowakowski, Average independence polynomials , J. Combin. Theory Ser. B 93
2005
Cited alongside, same era.
L. Lovász and B. Szegedy, Limits of dense graph sequences , J. Combin. Theory Ser. B 96
2006
Cited alongside, same era.
M. Chudnovsky and P. Seymour, The roots of the independence polynomial of a clawfree graph , J. Combin. Theory Ser. B 97
2007
Cited alongside, same era.
S. Chatterjee, The missing log in large deviations for triangle counts , Random Structures Algorithms 40
2012
Later among the works it cites.
B. Demarco and J. Kahn, Tight upper tail bounds for cliques , Random Structures Algorithms 41
2012
Later among the works it cites.
B. DeMarco and J. Kahn, Upper tails for triangles , Random Structures Algorithms 40
2012
Later among the works it cites.
L. Lovász, Large networks and graph limits , American Mathematical Society Colloquium Publications, vol. 60, American Mathematical Society, Providence, RI, 2012
2012
Later among the works it cites.
E. Lubetzky and Y. Zhao, On replica symmetry of large deviations in random graphs , Random Structures Algorithms 47
2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi, Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing , Adv. Math. 219
2008
Cited alongside, same era.
S. Chatterjee and P. S. Dey, Applications of Stein’s method for concentration inequalities , Ann. Probab. 38
2010
Cited alongside, same era.
S. Chatterjee and S. R. S. Varadhan, The large deviation principle for the Erdős-Rényi random graph , European J. Combin. 32
2011
Cited alongside, same era.
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi, Convergent sequences of dense graphs II. Multiway cuts and statistical physics , Ann. of Math. (2) 176
2012
Cited alongside, same era.
Cited in the paper.
S. Chatterjee, An introduction to large deviations for random graphs , Bull. Amer. Math. Soc. (N.S.) 53
2016
Closest in time.
S. Chatterjee and A. Dembo, Nonlinear large deviations , Adv. Math. 299
2016
Closest in time.
E. Lubetzky and Y. Zhao, On the variational problem for upper tails in sparse random graphs , Random Structures Algorithms 50
2017
Closest in time.