A hash function maps keys to buckets. If two keys hash to the same bucket, you have a collision.
Probability helps estimate collision rates. With n items and m buckets, the birthday paradox shows collisions happen sooner than you expect.
If m = 365 (like days in a year), you only need ~23 items before collision probability exceeds 50%. Hash tables use this analysis to choose table sizes.