Poisson randomization in occupancy problems

In occupancy problems we randomize the number of balls with a Poisson process of intensity α. Thus some classical formulas are very easily demonstrated and generalized with the aid of inclusion-exclusion principle. Then we give a general theorem to calculate the distributions and moments of particular random variables or waiting times when infinite balls are considered. This theorem can be applied to the well-known birthday and coupon collectors problems.