SIMPLE PROOFS OF OCCUPANCY TAIL BOUNDS

Authors
Citation
D. Dubhashi, SIMPLE PROOFS OF OCCUPANCY TAIL BOUNDS, Random structures & algorithms, 11(2), 1997, pp. 119-123
Citations number
10
Categorie Soggetti
Mathematics,Mathematics,Mathematics,"Computer Science Software Graphycs Programming
ISSN journal
10429832
Volume
11
Issue
2
Year of publication
1997
Pages
119 - 123
Database
ISI
SICI code
1042-9832(1997)11:2<119:SPOOTB>2.0.ZU;2-3
Abstract
We give a simple proof of an occupancy tail bound in the balls and bin s experiment using the method of bounded differences in expected form. We also indicate how a short, calculation-free proof of another occup ancy tail bound follows from an extension of the standard Chernoff-Hoe ffding bounds to variables that satisfy some general notions of negati ve dependence. (C) 1997 John Wiley & Sons, Inc.