Simple proofs of occupancy tail bounds

Random Structures and Algorithms

Volumn 11, Issue 2, 1997, Pages 119-123

  Dubhashi, Devdatt ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031479360     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199709)11:2<119::AID-RSA2>3.0.CO;2-V     Document Type: Article

References (10)

1. N. Alon, P. Erdos, and J. Spencer, The Probabilistic Method, Wiley, New York, 1992.
2. D. Dubhashi and D. Ranjan, Balls and bins: a study of negative dependence, Random Struct. Alg., submitted.
3. M. L. Eaton, Lectures on Topics on Probability Inequalities, CWI Tracts in Mathematics 35, Amsterdam, 1982.
4. K. Joag-Dev and F. Proschan, Negative association of random variables with applications, Ann. Stat., 11(4), 286-295 (1983).
5. A. Kamath, R. Motwani, K. Palem, and P. Spirakis, Tail bounds for occupancy problems and the satisfiability threshold conjecture, Random Struct. Alg., 7(1), 59-80 (1995).
6. C. McDiarmid, On the method of bounded differences, in Surveys in Combinatorics, J. Siemons, Ed., London Mathematical Society Lecture Note Series 141, 1989.
7. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
8. A. Panconesi and A. Srinivasan, Fast randomized algorithms for distributed edge coloring, Proc. ACM Sym. Principles of Distributed Computing, 1992, pp. 251-262.
9. R. Szekli, Stochastic Ordering and Dependence in Applied Probability, Lecture Notes in Statistics 97, Springer-Verlag, New York, 1995.
10. Y. L. Tong, Probability Inequalities in Multivariant Distributions, Academic New York, 1980.