  The statistical inference of stochastic block models as emerged as a
mathematicaly principled method for identifying communities inside networks.
Its objective is to find the node partition and the block-to-block adjacency
matrix of maximum likelihood i.e. the one which has most probably generated the
observed network. In practice, in the so-called microcanonical ensemble, it is
frequently assumed that when comparing two models which have the same number
and sizes of communities, the best one is the one of minimum entropy i.e. the
one which can generate the less different networks. In this paper, we show that
there are situations in which the minimum entropy model does not identify the
most significant communities in terms of edge distribution, even though it
generates the observed graph with a higher probability.
