D. Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent, The Annals of Probability, vol.25, issue.2, pp.812-854, 1997.
DOI : 10.1214/aop/1024404421
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.5889

D. Aldous and M. Steele, The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence, Probability on discrete structures, 2004.
DOI : 10.1007/978-3-662-09444-0_1

N. Alon and J. H. Spencer, The Probabilistic Method, 2000.

H. Amini, M. Draief, and M. Lelarge, Marketing in a Random Network, Proc. Network Control & Optimization LNCS 5425, pp.17-25, 2009.
DOI : 10.1073/pnas.082090499

H. Amini and M. Lelarge, The diameter of weighted random graphs, The Annals of Applied Probability, vol.25, issue.3, pp.1686-1727, 2015.
DOI : 10.1214/14-AAP1034
URL : https://hal.archives-ouvertes.fr/hal-01254904

N. Bailey, The Mathematical Theory of Infectious Diseases. Books on cognate subjects, 1975.

A. Banerjee, A. G. Chandrasekhar, E. Duflo, and M. O. Jackson, The diffusion of microfinance, Science, vol.341, p.53, 2013.

A. V. Banerjee, A Simple Model of Herd Behavior, The Quarterly Journal of Economics, vol.107, issue.3, pp.797-817, 1992.
DOI : 10.2307/2118364

A. D. Barbour and G. Reinert, Approximating the epidemic curve, Electronic Journal of Probability, vol.18, issue.0, pp.1-30, 2013.
DOI : 10.1214/EJP.v18-2557
URL : http://arxiv.org/abs/1301.3288

E. A. Bender and E. R. Canfield, The asymptotic number of labeled graphs with given degree sequences, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.296-307, 1978.
DOI : 10.1016/0097-3165(78)90059-6

S. Bhamidi, R. Van-der-hofstad, and G. Hooghiemstra, First passage percolation on random graphs with finite mean degrees, The Annals of Applied Probability, vol.20, issue.5, pp.1907-1965, 2010.
DOI : 10.1214/09-AAP666

B. B?aszczyszyn and D. Yogeshwaran, Directionally convex ordering of random measures, shot noise fields, and some applications to wireless communications, Advances in Applied Probability, vol.14, issue.03, pp.623-646, 2009.
DOI : 10.1287/moor.24.2.472

B. B?aszczyszyn and K. Gaurav, Viral marketing on configuration model

B. B?aszczyszyn and D. Yogeshwaran, Clustering and percolation of point processes, Electronic Journal of Probability, vol.18, issue.0, pp.1-20, 2013.
DOI : 10.1214/EJP.v18-2468

B. Bollobás, Random graphs vol, 2001.

B. Bollobás, Degree sequences of random graphs, Discrete Mathematics, vol.33, issue.1, pp.1-19, 1981.
DOI : 10.1016/0012-365X(81)90253-3

B. Bollobás, The Evolution of Random Graphs, Transactions of the American Mathematical Society, vol.286, issue.1, pp.257-274, 1984.
DOI : 10.2307/1999405

T. Britton, S. Janson, and A. Martin-löf, Graphs with specified degree distributions, simple epidemics, and local vaccination strategies, Advances in Applied Probability, vol.24, issue.04, pp.922-948, 2007.
DOI : 10.1002/rsa.20168
URL : http://arxiv.org/abs/math/0702021

J. Cheng, L. Adamic, P. A. Dow, J. M. Kleinberg, and J. Leskovec, Can cascades be predicted?, Proceedings of the 23rd international conference on World wide web, WWW '14, pp.925-936, 2014.
DOI : 10.1145/2566486.2567997
URL : http://arxiv.org/abs/1403.4608

F. Comets, F. Delarue, and R. Schott, Information Transmission under Random Emission Constraints, Combinatorics, Probability and Computing, vol.50, issue.06, pp.973-1009, 2014.
DOI : 10.1214/009117905000000413
URL : https://hal.archives-ouvertes.fr/hal-00637304

C. Cooper and A. Frieze, The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence, Combinatorics, Probability and Computing, vol.13, issue.3, pp.319-337, 2004.
DOI : 10.1017/S096354830400611X

E. Coupechoux and M. Lelarge, How Clustering Affects Epidemics in Random Networks, Advances in Applied Probability, vol.17, issue.04, pp.985-1008, 2014.
DOI : 10.1145/1555349.1555351
URL : https://hal.archives-ouvertes.fr/hal-01109159

E. Coupechoux and M. Lelarge, Contagions in random networks with overlapping communities, Advances in Applied Probability, vol.6, issue.04, pp.973-988, 2015.
DOI : 10.1002/rsa.3240060204
URL : https://hal.archives-ouvertes.fr/hal-01254908

A. Dembo and A. Montanari, Gibbs measures and phase transitions on sparse random graphs, Brazilian Journal of Probability and Statistics, vol.24, issue.2, pp.137-211, 2010.
DOI : 10.1214/09-BJPS027
URL : http://arxiv.org/abs/0910.5460

P. Domingos and M. Richardson, Mining the network value of customers, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '01, pp.57-66, 2002.
DOI : 10.1145/502512.502525

M. Draief and L. Massoulié, Epidemics and Rumors in Complex Networks, 2010.

P. Erdös and A. Rényi, On random graphs, I, Publicationes Mathematicae (Debrecen), vol.6, pp.290-297, 1959.

P. Erd?-os and A. Rényi, On the evolution of random graphs, PUBLICATION OF THE MATHEMATICAL INSTITUTE OF THE HUNGARIAN ACADEMY OF SCIENCES, pp.17-61, 1960.

N. Fountoulakis, Percolation on Sparse Random Graphs with Given Degree Sequence, Internet Mathematics, vol.4, issue.4, pp.329-356, 2007.
DOI : 10.1080/15427951.2007.10129148

N. Fountoulakis and K. Panagiotou, Rumor Spreading on Random Regular Graphs and Expanders, Lecture Notes in Computer Science, vol.6302, issue.12, pp.560-573, 2010.
DOI : 10.1007/978-3-642-15369-3_42
URL : http://arxiv.org/abs/1002.3518

N. Fountoulakis and K. Panagiotou, Rumor spreading on random regular graphs and expanders, Random Structures & Algorithms, vol.81, issue.2, pp.201-220, 2013.
DOI : 10.1002/rsa.20432
URL : http://arxiv.org/abs/1002.3518

N. Fountoulakis and B. A. Reed, A general critical condition for the emergence of a giant component in random graphs with given degrees, Electronic Notes in Discrete Mathematics, vol.34, pp.639-645, 2009.
DOI : 10.1016/j.endm.2009.07.108
URL : https://hal.archives-ouvertes.fr/hal-00795285

K. Gaurav, B. B?aszczyszyn, and P. Keeler, Pioneers of Influence Propagation in Social Networks, Proc. of CSoNet, collocated with COCOON, 2014.
DOI : 10.1007/978-3-319-08783-2_54
URL : https://hal.archives-ouvertes.fr/hal-00871276

E. N. Gilbert, Random Graphs, The Annals of Mathematical Statistics, vol.30, issue.4, pp.1141-1144, 1959.
DOI : 10.1214/aoms/1177706098

S. Janson, On percolation in random graphs with given vertex degrees, Electronic Journal of Probability, vol.14, issue.0, pp.86-118, 2009.
DOI : 10.1214/EJP.v14-603

S. Janson, The probability that a random multigraph is simple. II, Journal of Applied Probability, vol.45, issue.A, pp.123-137, 2014.
DOI : 10.1016/j.jcta.2005.03.005

S. Janson, D. E. Knuth, and B. Pittel, The birth of the giant component 1993

S. Janson and M. J. Luczak, A new approach to the giant component problem, Random Structures and Algorithms, vol.1, issue.2, pp.197-216, 2008.
DOI : 10.1002/rsa.20231

S. Janson and J. Spencer, A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution, Combinatorics, Probability and Computing, vol.16, issue.04, pp.631-658, 2007.
DOI : 10.1017/S0963548306008327

M. Kang and T. Seierstad, The Critical Phase for Random Graphs with a Given Degree Sequence, Combinatorics, Probability and Computing, vol.196, issue.01, pp.67-86, 2008.
DOI : 10.2307/1999405

R. M. Karp, The transitive closure of a random digraph, Random Structures and Algorithms, vol.7, issue.1, pp.73-93, 1990.
DOI : 10.1002/rsa.3240010106

D. Kempe, J. Kleinberg, and E. Tardos, Maximizing the spread of influence through a social network, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.137-146, 2003.
DOI : 10.1145/956750.956769

M. Lelarge, Diffusion and cascading behavior in random networks, Games and Economic Behavior, vol.75, issue.2, pp.752-775, 2012.
DOI : 10.1016/j.geb.2012.03.009
URL : https://hal.archives-ouvertes.fr/hal-01270330

T. Lindvall, Lectures on the Coupling Method, pp.67-71, 1992.

T. ?uczak, Component behavior near the critical point of the random graph process, Random Structures & Algorithms, vol.25, issue.3, pp.287-310, 1990.
DOI : 10.1002/rsa.3240010305

T. ?uczak, B. Pittel, and J. C. Wierman, The structure of a random graph at the point of the phase transition, Transactions of the American Mathematical Society, vol.341, issue.2, pp.721-748, 1994.
DOI : 10.1090/S0002-9947-1994-1138950-5

M. E. Newman, Assortative Mixing in Networks, Physical Review Letters, vol.89, issue.20, p.91, 2002.
DOI : 10.1103/PhysRevLett.89.208701
URL : http://arxiv.org/abs/cond-mat/0205405

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-180, 1995.
DOI : 10.1002/rsa.3240060204

M. Molloy and B. Reed, The Size of the Giant Component of a Random Graph with a Given Degree Sequence, Combinatorics, Probability and Computing, vol.7, issue.3, pp.295-305, 1998.
DOI : 10.1017/S0963548398003526

M. E. Newman, Spread of epidemic disease on networks, Physical Review E, vol.66, issue.1, pp.16128-53, 2002.
DOI : 10.1103/PhysRevE.66.016128

M. D. Penrose, The longest edge of the random minimal spanning tree, The Annals of Applied Probability, vol.7, issue.2, pp.340-361, 1997.
DOI : 10.1214/aoap/1034625335

S. Bikhchandani, D. H. Welch, and I. , A Theory of Fads, Fashion, Custom, and Cultural Change as Informational Cascades, Journal of Political Economy, vol.100, issue.5, pp.992-1026, 1992.
DOI : 10.1086/261849

T. E. Harris, The theory of branching processes, 1963.
DOI : 10.1007/978-3-642-51866-9

R. Van-der-hofstad, Random graphs and complex networks Available on http, pp.20-67, 2014.