Counting Formal Concepts of A Random Formal Context

It is well-known that counting formal concepts in a formal context is a challenging #P-complete problem. To determine the expected number of formal concepts in a formal context, we consider a random formal context, where each attribute occurs with a certain probability. Utilizing mathematical expectation, we derive both the lower and upper bounds for the superpolynomial representation of the expected number of formal concepts, with the upper bound in superpolynomial form being presented for the first time.