A Large Deviation Inequality for Functions of Independent, Multi-Way Choices

Combinatorics Probability and Computing

Volumn 7, Issue 1, 1998, Pages 57-63

  Grable, D A ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032354775     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003246     Document Type: Article

References (9)

1. Alon, N., Kim, J. H. and Spencer J. (1997) Nearly perfect matchings in regular simple hypergraphs. Israel J. Math. 100 171-188.
2. Azuma, K. (1967) Weighted sums of certain dependent random variables. Tôkuku Math. J. 19 357-367.
3. Chernoff, H. (1952) A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observables. Ann. Math. Stat. 23 493-509.
4. Grable, D. A. and Panconesi, A. (1997) Nearly optimal distributed edge colouring in O(log log n) rounds. Random Structures and Algorithms 10 385-405.
5. Hoeffding, W. (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 13-30.
6. Johansson, A. (1996) An improved upper bound on the choice number for triangle free graphs. Preprint.
7. Kim, J. H. (1995) On Brooks' theorem for sparse graphs. Combinatorics, Probability and Computing 4 97-132.
8. 2/log t. Random Structures and Algorithms 7 173-207.
9. McDiarmid, C. (1989) On the method of bounded differences. In Surveys in Combinatorics: LMS Lecture Notes Series (Siemons, J., ed.), 141 148-188.