The Infamous Upper Tail

Random Structures and Algorithms

Volumn 20, Issue 3, 2002, Pages 317-342

  Janson, Svante ^a   Ruciński, Andrzej ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242299142     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10031     Document Type: Conference Paper

References (21)

1. G. Bennett, Probability inequalities for the sum of independent random variables, J Am Stat Assoc 57 (1962), 33-45.
2. S. Boucheron, G. Lugosi, and P. Massart, A sharp concentration inequality with applications, Random Struct Alg 16 (2000), 277-292.
3. P. Erdos and A. Rényi, On the evolution of random graphs, Publ Math Inst Hung Acad Sci 5 (1960), 17-61.
4. E. Friedgut, V. Rödl, A. Ruciński, and P. Tetali, Sharp thresholds for Ramsey properties, in preparation.
5. E. Friedgut, Y. Kohayakawa, V. Rödl, A. Ruciński, and P. Tetali, Ramsey games against one-armed bandit, in preparation.
6. A. Hajnal and E. Szemerédi, Proof of a conjecture of Erdos, Combinatorial theory and its applications, Vol. II, P. Erdos, A. Rényi, and V. T. Sós (Editors), Colloq. Math. Soc. János Bolyai 4, North-Holland, Amsterdam, 1970, pp. 601-623.
7. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Am Stat Assoc 58 (1963), 13-30.
8. S. Janson, Poisson approximation for large deviations, Random Struct Alg 1 (1990), 221-230.
9. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
10. S. Janson and A. Ruciński, The deletion method for upper tail estimates, Technical Report U.U.D.M. 2000:28, Uppsala University, Uppsala, Sweden.
11. J. H. Kim and V. Vu, Concentration of multivariate polynomials and applications, Combinatorica 20 (2000), 417-434.
12. C. McDiarmid, On the method of bounded differences, Surveys in combinatorics (Proceedings, Norwich 1989), London Math. Soc. Lecture Note Ser. 141, Cambridge University Press, Cambridge, 1989, pp. 148-188.
13. C. McDiarmid, Concentration, Probabilistic methods for algorithmic discrete mathematics, M. Habib, C. McDiarmid, J. Ramirez, and B. Reed (Editors), Springer-Verlag, Berlin, 1998, pp. 195-248.
14. V. Rödl and A. Ruciński, Random graphs with monochromatic triangles in every edge coloring, Random Struct Alg 5(2) (1994), 253-270.
15. V. Rödl and A. Ruciński, Threshold functions for Ramsey properties, J Am Math Soc 8 (1995), 917-942.
16. J. Spencer, Counting extensions, J Combin Theor A 55 (1990), 247-255.
17. M. Talagrand, Concentration of measure and isoperimetric inequalities in product spaces, Inst Hautes Études Sci Publ Math 81 (1995), 73-205.
18. V. H. Vu, On the concentration of multivariate polynomials with small expectation, Random Struct Alg 16(4) (2000), 344-363.
19. V. H. Vu, New bounds on nearly perfect matchings in hypergraphs: higher codegrees do help, Random Struct Alg 17(1) (2000), 29-63.
20. V. H. Vu, A large deviation result on the number of small subgraphs of a random graph, Technical Report MSR-TR-99-90, Combin Probab Comput, to appear.
21. V. H. Vu, Concentration of non-Lipschitz functions and applications, Random Struct Alg, to appear.