Expected Number Of Uniformly Distributed Balls In A Most Loaded Bin Using Placement With Simple Linear Functions

Babka Martin. Arxiv 2014

[Paper]    
ARXIV Independent

We estimate the size of a most loaded bin in the setting when the balls are placed into the bins using a random linear function in a finite field. The balls are chosen from a transformed interval. We show that in this setting the expected load of the most loaded bins is constant. This is an interesting fact because using fully random hash functions with the same class of input sets leads to an expectation of $\mathrm{\Theta }\left(\frac{logm}{loglogm}\right)$ balls in most loaded bins where $m$ is the number of balls and bins. Although the family of the functions is quite common the size of largest bins was not known even in this simple case.

Similar Work

• On The Relationship Between Several Variants Of The Linear Hashing Conjecture
• Derandomized Balanced Allocation
• Non-empty Bins With Simple Tabulation Hashing
• Hashing For Statistics Over K-partitions