Analysis of resolution limit in community detection

In this paper, we discussed the resolution limit problem for an information approach that identifies communities in a network by finding an optimal compression of topological structure for the network. We tested the resolution scale of the approach on the examples mentioned by Fortunato and Barthélemy. We found that the approach can correctly uncover the build-in communities in the networks. We also compared the approach with some state of the art methods on LFR benchmark as well as on real-world networks. The results in this paper may provide us a deep understanding for the approach.