D. Auber, Y. Chiricota, F. Jourdan, and G. Melançon, Multiscale visualization of small world networks, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714), 2003.
DOI : 10.1109/INFVIS.2003.1249011
URL : https://hal.archives-ouvertes.fr/lirmm-00269770

D. Auber and F. Jourdan, Interactive Refinement of Multi-scale Network Clusterings, Ninth International Conference on Information Visualisation (IV'05), pp.703-709, 2005.
DOI : 10.1109/IV.2005.65
URL : https://hal.archives-ouvertes.fr/hal-00307633

M. Bayati, J. Kim, and A. Saberi, A Sequential Algorithm for Generating Random Graphs, Algorithmica, vol.20, issue.3, pp.860-910, 2010.
DOI : 10.1007/s00453-009-9340-1

R. Boulet, B. Jouve, F. Rossi, and N. , VILLA : Batch kernel SOM and related laplacian methods for social network analysis, Neurocomputing, vol.71, pp.7-91257, 2008.

R. Bourqui, D. Auber, and P. Mary, How to draw clustered weighted graphs using a multilevel force-directed graph drawing algorithm, Proceedings of the 11th International Conference Information Visualization, pp.757-764, 2007.

F. Chung, Random graphs, a whirlwind tour of, éditeur : Encyclopedia of Complexity and Systems Science, pp.7493-7505, 2009.

S. Clémençon, H. De-arazoza, F. Rossi, and V. C. Tran, Hierarchical clustering for graph visualization, Proceedings of XVIIIth European Symposium on Artificial Neural Networks, pp.227-232, 2011.

S. Clémençon, H. De-arazoza, F. Rossi, V. C. Tran-joan, C. Ignacio et al., Visual mining of epidemic networks, éditeurs : Advances in Computational Intelligence, Proceedings of 11th International Work-Conference on Artificial Neural Networks (IWANN 2011), numéro 6692 de Lecture Notes in Computer Science, pp.276-283, 2011.

G. Csardi and T. Nepusz, The igraph software package for complex network research, InterJournal, Complex Systems, 2006.

J. J. Daudin, F. Picard, and S. Robin, A mixture model for random graphs, Statistics and Computing, vol.4, issue.2, pp.173-183, 2008.
DOI : 10.1007/s11222-007-9046-7
URL : https://hal.archives-ouvertes.fr/inria-00070186

G. Di-battista, P. Eades, R. Tamassia, and I. G. , TOLLIS : Graph Drawing : Algorithms for the Visualization of Graphs, 1999.

P. Eades, A heuristic for graph drawing, Congressus Numerantium, vol.42, pp.149-160, 1984.

P. Eades and Q. W. , FENG : Multilevel visualization of clustered graphs, Stephen C. NORTH, éditeur : Graph Drawing, Symposium on Graph Drawing, GD '96 Proceedings, volume 1190 de Lecture Notes in Computer Science, pp.101-112, 1996.

P. Eades and M. L. Huang, Navigating Clustered Graphs Using Force-Directed Methods, Journal of Graph Algorithms and Applications, vol.4, issue.3, pp.157-181, 2000.
DOI : 10.7155/jgaa.00029

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

S. Fortunato and M. Barthélémy, Resolution limit in community detection, Proceedings of the National Academy of Sciences, pp.36-41, 2007.
DOI : 10.1073/pnas.0605965104

T. Fruchterman, REINGOLD : Graph drawing by force-directed placement. Software-Practice and Experience, pp.1129-1164, 1991.

S. Mark, D. R. Handcock, C. T. Hunter, S. M. Butts, . Goodreau et al., statnet : Software tools for the Statistical Modeling of Network Data, 2003.

D. Harel and Y. Koren, Drawing graphs with non-uniform vertices, Proceedings of the Working Conference on Advanced Visual Interfaces, AVI '02, pp.157-166, 2002.
DOI : 10.1145/1556262.1556288

I. Herman, G. Melançon, M. Scott, and . Marshall, Graph visualization and navigation in information visualization: A survey, IEEE Transactions on Visualization and Computer Graphics, vol.6, issue.1, pp.24-43, 2000.
DOI : 10.1109/2945.841119

P. D. Hoff, A. E. Raftery, and M. S. , Latent Space Approaches to Social Network Analysis, Journal of the American Statistical Association, vol.97, issue.460, pp.1090-1098, 2002.
DOI : 10.1198/016214502388618906

N. Pavel, . Krivitsky, and S. Mark, HANDCOCK : Fitting latent cluster models for networks with latentnet, Journal of Statistical Software, vol.24, issue.5, pp.1-23, 2008.

R. Milo, N. Kashtan, S. Itzkovitz, M. E. Newman, and U. , ALON : On the uniform generation of random graphs with prescribed degree sequences. eprint arXiv :cond-mat, 2003.

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

M. E. Newman, Finding community structure in networks using the eigenvectors of matrices, Physical Review E, vol.74, issue.3, p.74, 2006.
DOI : 10.1103/PhysRevE.74.036104

M. E. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, vol.69, issue.2, p.26113, 2004.
DOI : 10.1103/PhysRevE.69.026113

A. Noack, Energy Models for Graph Clustering, Journal of Graph Algorithms and Applications, vol.11, issue.2, pp.453-480, 2007.
DOI : 10.7155/jgaa.00154

A. Noack, Modularity clustering is force-directed layout, Physical Review E, vol.79, issue.2, 2009.
DOI : 10.1103/PhysRevE.79.026102

A. Noack and R. Rotta, Multi-level Algorithms for Modularity Clustering, SEA '09 : Proceedings of the 8th International Symposium on Experimental Algorithms, pp.257-268, 2009.
DOI : 10.1007/978-3-642-02011-7_24

P. Pons, LATAPY : Post-processing hierarchical community structures : Quality improvements and multi-scale view, Theoretical Computer Science, vol.412, pp.8-10892, 2011.

R. Development and C. Team, R : A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, 2011.

A. R. Rao, R. Jana, and S. Bandyopadhyay, A markov chain monte carlo method for generating random (0, 1)-matrices with given marginals, Sankhya : The Indian Journal of Statistics, Series A, vol.58, issue.2, pp.225-242, 1996.

J. Reichardt and S. Bornholdt, Partitioning and modularity of graphs with arbitrary degree distribution, Physical Review E, vol.76, issue.1, p.15102, 2007.
DOI : 10.1103/PhysRevE.76.015102

J. M. Roberts-jr, Simple methods for simulating sociomatrices with given marginal totals, Social Networks, vol.22, issue.3, pp.273-283, 2000.
DOI : 10.1016/S0378-8733(00)00026-5

F. Rossi and N. Villa-vialaneix, Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach, Neurocomputing, vol.73, issue.7-9, pp.7-91142, 2010.
DOI : 10.1016/j.neucom.2009.11.023
URL : https://hal.archives-ouvertes.fr/hal-00515892

S. E. Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.
DOI : 10.1016/j.cosrev.2007.05.001

M. Seifi, J. L. Guillaume, M. Latapy, B. Le, and . Grand, Visualisation interactive multi-??chelle des grands graphes. Application ?? un r??seau de blogs, Atelier EGC 2010, Visualisation et Extraction de Connaissances, 2010.
DOI : 10.3166/ria.26.351-368

Q. D. Truong, T. Dkaki, and P. J. Charrel, An energy model for the drawing of clustered graphs, Proceedings of Vème colloque international VSST, pp.21-25, 2007.

D. Tunkelang, A Numerical Optimization Approach to General Graph Drawing, 1999.

X. Wang and I. Miyamoto, Generating customized layouts In Franz BRANDENBURG, éditeur : Graph Drawing, volume 1027 de, Lecture Notes in Computer Science, pp.504-515, 1996.

H. Zanghi, C. Ambroise, and V. Miele, Fast online graph clustering via Erd??s???R??nyi mixture, Pattern Recognition, vol.41, issue.12, pp.3592-3599, 2008.
DOI : 10.1016/j.patcog.2008.06.019