Abstract
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower bounds which are reached with high probability. We prove bounds for all values of m(n) ≧ n/polylog(n) by using the simple and well-known method of the first and second moment.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. Azar, A.Z. Broder, A.R. Karlin, and E. Upfal. On-line load balancing (extended abstract). In 33rd Annual Symposium on Foundations of Computer Science, pages 218–225, Pittsburgh, Pennsylvania, 24–27 October 1992. IEEE.
B. Bollobás. Random graphs. Academic Press, New York-San Francisco-London-San Diego, 1985.
A. Czumaj and V. Stemann. Randomized allocation processes. In 38th Annual Symposium on Foundations of Computer Science, pages 194–203, 1997.
G.H. Gonnet. Expected length of the longest probe sequence in hash code searching. J. ACM, 28(2):289–304, 1981.
N. Johnson and S. Kotz. Urn Models and Their Applications. John Wiley and Sons, 1977.
M.D. Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. PhD thesis, Computer Science Department, University of California at Berkeley, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raab, M., Steger, A. (1998). “Balls into Bins” — A Simple and Tight Analysis. In: Luby, M., Rolim, J.D.P., Serna, M. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 1998. Lecture Notes in Computer Science, vol 1518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49543-6_13
Download citation
DOI: https://doi.org/10.1007/3-540-49543-6_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65142-0
Online ISBN: 978-3-540-49543-7
eBook Packages: Springer Book Archive