After presenting an algorithm providing concepts and frequent concepts, we will study the random size of concept lattices in the case of a Bernoulli(p) context. Next, for random lines which are independent and identically distributed or more generally outcomes of a Markov chain, we will show the almost everywhere convergence of the random closed intents towards deterministic intents. Finally we will consider the problem of predicting the number of concepts before choosing any algorithm.