Balls in Boxes: Variations on a Theme of Warren Ewens and Herbert Wilf
Shalosh B. Ekhad, Doron Zeilberger

TL;DR
This paper critiques and simplifies the analysis of the balls-and-boxes problem, advocating for the Poisson Approximation over complex methods, with practical implications for real-world applications.
Contribution
It demonstrates that the Poisson Approximation is preferable to Ewens and Wilf's method for analyzing maximums in balls-and-boxes problems, simplifying the approach.
Findings
Poisson Approximation outperforms complex methods in real-world scenarios.
Extremely unlikely events are negligible in practical applications.
The paper provides a Maple package for implementation.
Abstract
We comment on, elaborate, and extend the work of Warren Ewens and Herbert Wilf, described in their http://www.pnas.org/content/104/27/11189.full.pdf about the maximum in balls-and-boxes problem. In particular we meta-apply their ingenious method to show that it is not really needed, and that one is better off using the so-called Poisson Approximation, at least in applications to the real world, because extremely unlikely events mever happen in real life. This article is accompanied by the Maple package http://www.math.rutgers.edu/~zeilberg/tokhniot/BallsInBoxes">BallsInBoxes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Advanced Database Systems and Queries · Artificial Intelligence in Games
