M. Newman, A. Barabási, and D. J. Watts, The Structure and Dynamics of Networks, 2006.

M. E. Newman, The Structure and Function of Complex Networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.
DOI : 10.1137/S003614450342480

A. Barabasi and R. Albert, Emergence of scaling in random networks, SCIENCE, vol.286, pp.509-512, 1999.

S. H. Strogatz, Exploring complex networks, Nature, vol.84, issue.6825, pp.268-276, 2001.
DOI : 10.1038/35065725

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

E. A. Leicht and M. E. Newman, Community Structure in Directed Networks, Physical Review Letters, vol.100, issue.11, p.118703, 2008.
DOI : 10.1103/PhysRevLett.100.118703

S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, 1994.
DOI : 10.1017/CBO9780511815478

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, ACM conference SIGCOMM, pp.251-262, 1999.

B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, The Bell system technical journal, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences, pp.7821-7826, 2002.
DOI : 10.1073/pnas.122653799

F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, Defining and identifying communities in networks, Proceedings of the National Academy of Sciences, vol.101, issue.9, 2004.
DOI : 10.1073/pnas.0400054101

S. Fortunato, V. Latora, and M. Marchiori, Method to find community structures based on information centrality, Physical Review E, vol.70, issue.5, p.56104, 2004.
DOI : 10.1103/PhysRevE.70.056104

A. Clauset, M. E. Newman, and C. Moore, Finding community structure in very large networks, Physical Review E, vol.70, issue.6, p.66111, 2004.
DOI : 10.1103/PhysRevE.70.066111

L. Donetti and M. A. Muñoz, Improved spectral algorithm for the detection of network communities, AIP Conference Proceedings, pp.1-2, 2005.
DOI : 10.1063/1.2008598

S. V. Dongen, Graph clustering by flow simulation, 2000.

H. Zhou and R. Lipowsky, Network Brownian Motion: A New Method to Measure Vertex-Vertex Proximity and to Identify Communities and Subcommunities, Proceedings of International Conference on Computational Science (ICCS), pp.1062-1069, 2004.
DOI : 10.1007/978-3-540-24688-6_137

L. Yen, D. Vanvyve, F. Wousters, F. Fouss, M. Verleysen et al., Clustering using a random walk based distance measure, Proceedings of European Symposium on Artificial Neural Networks (ESANN), 2005.

P. Pons and M. Latapy, Computing Communities in Large Networks Using Random Walks, Journal of Graph Algorithms and Applications, vol.10, issue.2, pp.191-218, 2006.
DOI : 10.7155/jgaa.00124

M. Rosvall and C. T. Bergstrom, Maps of random walks on complex networks reveal community structure, Proceedings of the National Academy of Sciences USA, pp.1118-1123, 2008.
DOI : 10.1073/pnas.0706851105

A. Lancichinetti and S. Fortunato, Community detection algorithms: A comparative analysis, Physical Review E, vol.80, issue.5, p.56117, 2009.
DOI : 10.1103/PhysRevE.80.056117
URL : http://arxiv.org/abs/0908.1062

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

A. Lancichinetti, S. Fortunato, and F. Radicchi, Benchmark graphs for testing community detection algorithms, Physical Review E, vol.78, issue.4, p.46110, 2008.
DOI : 10.1103/PhysRevE.78.046110
URL : http://arxiv.org/abs/0805.4770

A. Lancichinetti and S. Fortunato, Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities, Physical Review E, vol.80, issue.1, pp.1-8, 2009.
DOI : 10.1103/PhysRevE.80.016118

L. Danon, A. Díaz-guilera, J. Duch, and A. Arenas, Comparing community structure identification, Journal of Statistical Mechanics: Theory and Experiment, vol.2005, issue.09, pp.9-17, 2005.
DOI : 10.1088/1742-5468/2005/09/P09008
URL : http://arxiv.org/abs/cond-mat/0505245

A. Lancichinetti, S. Fortunato, and J. Kertész, Detecting the overlapping and hierarchical community structure in complex networks, New Journal of Physics, vol.11, issue.3, p.33015, 2009.
DOI : 10.1088/1367-2630/11/3/033015

E. Navarro and R. Cazabet, Détection de communautés, ´ etude comparative sur graphes réels, 1` eres Journées Modèles et l'Analyse des Réseaux : Approches Mathématiques et Informatique, 2010.

G. W. Milligan, S. C. Soon, and L. M. Sokol, The Effect of Cluster Size, Dimensionality, and the Number of Clusters on Recovery of True Cluster Structure, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.5, issue.1, pp.40-47, 1983.
DOI : 10.1109/TPAMI.1983.4767342

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

B. C. Fung, K. Wang, and M. Ester, Hierarchical Document Clustering Using Frequent Itemsets, SIAM International Conference on Data Mining, 2003.
DOI : 10.1137/1.9781611972733.6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.9326

J. Madadhain, D. Fishera, P. Smyth, S. White, and Y. B. Boey, Analysis and visualization of network data using jung, Journal of Statistical Software, pp.1-25, 2005.