Detecting the optimal number of communities in complex networks

► We propose a method to find the optimal number of communities in complex networks based on the information theoretic ideas. ► The method can be simply applied to almost all the algorithms with random characteristics. ► It will not increase the complexity of the algorithms, which just repeat the algorithm for several times. ► A point we should mention is that our method needn't to know the “real” community structures in advance.