S. Wasserman, K. Faust, and D. Iacobucci, Social Network Analysis : Methods and Applications (Structural Analysis in the Social Sciences)
DOI : 10.1017/CBO9780511815478

D. Watts and S. Strogatz, Collective dynamics of small-world networks, Nature, issue.393, pp.440-442, 1998.

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp.251-262, 1999.

P. Erdos and A. Renyi, On random graphs, Publ. Math. Debrecen, vol.6, p.290, 1959.

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

S. Wasserman and G. L. Robins, An introduction to random graphs, dependence graphs, and p*, " in Models and methods in social network analysis, pp.148-161, 2005.

M. Newman, D. Watts, and S. Strogatz, Random graph models of social networks, Proceedings of the National Academy of Sciences, vol.99, issue.Supplement 1, pp.2566-2572, 2002.
DOI : 10.1073/pnas.012582999

V. Batagelj and U. Brandes, Efficient generation of large random networks, Physical Review E, vol.71, issue.3, p.36113, 2005.
DOI : 10.1103/PhysRevE.71.036113

R. Milo, N. Kashtan, S. Itzkovitz, M. E. Newman, and U. Alon, On the uniform generation of random graphs with prescribed degree sequences Arxiv preprint cond, 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

F. Viger and M. Latapy, Efficient and simple generation of random simple connected graphs with prescribed degree sequence, Proceedings of the 11th international conference on Computing and Combinatorics, ser. LNCS, pp.440-449, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01468081

T. Snijders, Enumeration and simulation methods for 0???1 matrices with given marginals, Psychometrika, vol.73, issue.3, pp.397-417, 1991.
DOI : 10.1007/BF02294482

S. L. Hakimi, On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I, Journal of the Society for Industrial and Applied Mathematics, vol.10, issue.3, pp.496-506, 1962.
DOI : 10.1137/0110037

J. Blitzstein and P. Diaconis, A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees, Internet Mathematics, vol.6, issue.4, pp.489-522, 2011.
DOI : 10.1080/15427951.2010.557277

M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Structures & Algorithms, vol.3, issue.2-3, pp.161-179, 1995.
DOI : 10.1002/rsa.3240060204

L. A. Adamic and N. Glance, The political blogosphere and the 2004 U.S. election, Proceedings of the 3rd international workshop on Link discovery , LinkKDD '05, pp.36-43, 2005.
DOI : 10.1145/1134271.1134277

M. E. Newman, Mixing patterns in networks, Physical Review E, vol.67, issue.2, 2003.
DOI : 10.1103/PhysRevE.67.026126

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

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, p.16118, 2009.
DOI : 10.1103/PhysRevE.80.016118