  In formal concept analysis, it is well-known that the number of formal
concepts can be exponential in the worst case. To analyze the average case, we
introduce a probabilistic model for random formal contexts and prove that the
average number of formal concepts has a superpolynomial asymptotic lower bound.
