We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with the martingale method by Kim and Vu, which often leads to similar results.
Some applications are given to the number X G of copies of a graph G in the random graph \(\Bbb G \)(n,p). In particular, for G = K 4 and G = C 4 we improve the earlier known upper bounds on —ln ℙ(X G ≥ 2\(\Bbb E\) X G ) in some range of p = p(n).
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
* Research of the second author supported by KBN grants 2 P03A 032 16 and 2 P03A 015 23.
Rights and permissions
About this article
Cite this article
Janson, S., Ruciński*, A. The Deletion Method For Upper Tail Estimates. Combinatorica 24, 615–640 (2004). https://doi.org/10.1007/s00493-004-0038-3
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s00493-004-0038-3