L. Da-fontura-costa, O. O. Jr, G. Travieso, A. Rodrigues-r, V. Boas et al., Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications arXiv physics.soc-ph 0711, p.3199, 2008.

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.75-174, 2010.
DOI : 10.1016/j.physrep.2009.11.002

A. Lancichinetti, S. Fortunato, and F. Radicchi, Benchmark graphs for testing community detection algorithms Phys Rev, p.46110, 2008.
DOI : 10.1103/physreve.78.046110
URL : http://arxiv.org/abs/0805.4770

L. Danon and . Diaz-, Guilera A and Arenas A 2006 The effect of size heterogeneity on community identification in complex networks, 11010.

D. H. Wolpert and W. Macready, Free Lunch Theorems for search, 1995.

G. K. Orman and V. Labatut, The Effect of Network Realism on Community Detection Algorithms, 2010 International Conference on Advances in Social Networks Analysis and Mining, pp.301-306, 2010.
DOI : 10.1109/ASONAM.2010.70
URL : https://hal.archives-ouvertes.fr/hal-00633641

W. Rand, Objective Criteria for the Evaluation of Clustering Methods, Journal of the American Statistical Association, vol.15, issue.336, pp.846-50, 1971.
DOI : 10.1080/01621459.1963.10500845

L. Hubert and P. Arabie, Comparing partitions, Journal of Classification, vol.78, issue.1, pp.193-218, 1985.
DOI : 10.1007/BF01908075

L. Danon and J. Duch, Arenas A and Díaz-Guilera A 2007 Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science, pp.93-113

M. Rosvall and C. Bergstrom, An information-theoretic framework for resolving community structure in complex networks, Proceedings of the National Academy of Sciences, vol.104, issue.18, pp.7327-7358, 2007.
DOI : 10.1073/pnas.0611034104

U. N. Raghavan, R. Albert, and S. Kumara, Near linear time algorithm to detect community structures in large-scale networks Phys. Rev, p.36106, 2007.

S. Gregory, Finding overlapping communities in networks by label propagation, New Journal of Physics, vol.12, issue.10, p.103018
DOI : 10.1088/1367-2630/12/10/103018

S. Van-dongen, Graph Clustering Via a Discrete Uncoupling Process, SIAM Journal on Matrix Analysis and Applications, vol.30, issue.1, pp.121-162, 2008.
DOI : 10.1137/040608635

M. Molloy and R. B. , A critical point for random graphs with a given degree sequence Random Structures and Algorithms, pp.161-79, 1995.

G. K. Orman, V. Labatut, H. Cherifi, and . Cherifi, Qualitative Comparison of Community Detection Algorithms, pp.265-79, 2011.
DOI : 10.1073/pnas.0605965104
URL : https://hal.archives-ouvertes.fr/hal-00611385

J. Bagrow, Evaluating local community methods in networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.05, 2008.
DOI : 10.1088/1742-5468/2008/05/P05001