Large deviations for sums of partly dependent random variables

Random Structures and Algorithms

Volumn 24, Issue 3, 2004, Pages 234-248

  Janson, Svante ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 11144268948     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20008     Document Type: Article

References (23)

1. A. K. Aleshkyavichene, Probabilities of large deviations for U-statistics and von Mises functionals, (Russian) Teor Veroyatnost i Primenen 35(1) (1990), 3-14 (in Russian) [Engl. transi. Theory Probab. Appl. 35(1) (1990), 1-14.
2. A. K. Aleshkyavichene, Probabilities of large deviations for U-statistics and von Mises functionals, (Russian) Teor Veroyatnost i Primenen 35(1) (1990), 3-14 (in Russian) [Engl. transi. Theory Probab. Appl. 35(1) (1990), 1-14.
3. M. A. Arcones and E. Gine, Limit theorems for U-processes, Ann Probab 21(3) (1993), 1494-1542.
4. G. Bennett, Probability inequalities for the sum of independent random variables, J Amer Statist Assoc 57 (1962), 33-45.
5. S. Bernstein, On a modification of Chebyshev's inequality and of the error formula of Laplace, Ann Sci Inst Sav Ukraine Sect Math 1 (1924), 38-49 (in Russian).
6. B. Bollobás, Extremal graph theory, Academic Press, London, 1978.
7. B. Bollobás, Modern graph theory, Springer-Verlag, New York, 1998.
8. J. Bretagnolle, A new large deviation inequality for U-statistics of order 2, ESAIM Probab Statist 3 (1999), 151-162.
9. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann Math Statist 23 (1952), 493-507.
10. H. Cramér, "Sur un noveau théorème-limite de la théorie des probabilités," Les sommes et les fonctions de variables aléatoires, Actualités Sci Indust 736, 5-23. Hermann Paris, 1938.
11. W. Feller, Generalization of a probability limit theorem of Cramer, Trans Amer Math Soc 54 (1943), 361-372.
12. P. Flajolet, Y. Guivarc'h, W. Szpankowski, and B. Vallée, "Hidden pattern statistics," Automata, languages, and programming (ICALP'2001), Eds. F. Orejas et al., Lecture Notes in Computer Science 2076, 152-165. Springer-Verlag, New York, 2001.
13. A. Hajnal and E. Szemerédi, "Proof of a conjecture of Erdös," combinatorial theory and its applications, Vol. II, Eds. P. Erdös, A. Rényi, and V. T. Sós, Colloq Math Soc János Bolyai 4, 601-623. North-Holland, Amsterdam, 1970.
14. W. Hoeffding, A class of statistics with asymptotically normal distribution, Ann Math Statist 19 (1948), 293-325.
15. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Amer Statist Assoc 58 (1963), 13-30.
16. S. Janson, T. Luczak, and A. Rucíiski, "An exponential bound for the probability of nonexistence of a specified subgraph in a random graph," Random Graphs '87 (Proceedings, Poznań 1987), Eds. M. Karoński, J. Jaworski, and A. Ruciński, 73-87. Wiley, Chichester, 1990.
17. S. Janson, T. Luczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
18. S. Janson, K. Oleszkiewicz, and A. Ruciński, Upper tails for subgraph counts in random graphs, Israel J Math, to appear.
19. S. Janson and A. Ruciński, The infamous upper tail, Random Structures Algorithms 20(3) (2002), 317-342.
20. M. Okamoto, Some inequalities relating to the partial sum of binomial probabilities, Ann Inst Statist Math 10 (1958), 29-35.
21. S. V. Pemmaraju, "Equitable coloring extends Chernoff-Hoeffding bounds," Approximation, randomization and combinatorial optimization: Algorithms and techniques (APPROX 2001 and RANDOM 2001), Eds. M. X. Goemans et al., Lecture Notes in Computer Science 2129, 285-296. 2129, Springer-Verlag, New York, 2001.
22. V. Rödl and A. Ruciński, Random graphs with monochromatic triangles in every edge coloring, Random Structures Algorithms 5(1) (1994), 253-270.
23. V. H. Vu, A large deviation result on the number of small subgraphs of a random graph, Combin Probab Comput 10(1) (2001), 79-94.