M. Abramowitz and I. A. , Stegun : Handbook of mathematical functions with formulas, graphs, and mathematical tables, volume 55 de National Bureau of Standards Applied Mathematics Series. For sale by the Superintendent of Documents, U.S. Government Printing Office, ABR09] L. Addario-Berry et B. Reed : Minima in branching random walks, 1964.

]. D. Ald97 and . Aldous, Aldous : Brownian excursions, critical random graphs and the multiplicative coalescent Limic : The entrance boundary of the multiplicative coalescent, Ann. Probab. Electron. J. Probab, vol.25, issue.59, pp.812-854, 1997.

A. [. Arratia, S. Barbour, . A. Tavaré-[-bc78-]-e, E. R. Bender, and . Canfield, Logarithmic combinatorial structures: a probabilistic approach The asymptotic number of labeled graphs with given degree sequences, EMS Monographs in Mathematics . European Mathematical Society J. Combinatorial Theory Ser. A, issue.3, pp.24296-307, 1978.

]. J. Ber96 and . Bertoin, Lévy processes, volume 121 de Cambridge Tracts in Mathematics, 1996.

]. J. Ber01, Bertoin : Homogeneous fragmentation processes. Probab. Theory Related Fields, pp.301-318, 2001.

]. J. Ber02 and . Bertoin, Self-similar fragmentations, Ann. Inst. H. Poincaré Probab. Statist, vol.38, issue.3, pp.319-340, 2002.

]. J. Ber06 and . Bertoin, Random fragmentation and coagulation processes, volume 102 de Cambridge Studies in Advanced Mathematics, 2006.

]. J. Ber08 and . Bertoin, Asymptotic regimes for the occupancy scheme of multiplicative cascades. Stochastic Process, Appl, vol.118, issue.9, pp.1586-1605, 2008.

J. Bertoin and A. V. Gnedin, Asymptotic Laws for Nonconservative Self-similar Fragmentations, Electronic Journal of Probability, vol.9, issue.0, pp.575-593, 2004.
DOI : 10.1214/EJP.v9-215
URL : https://hal.archives-ouvertes.fr/hal-00103546

J. Bertoin and V. Sidoravicius, The Structure of Typical Clusters in Large Sparse Random Configurations, Journal of Statistical Physics, vol.12, issue.1, pp.87-105, 2009.
DOI : 10.1007/s10955-009-9728-y
URL : https://hal.archives-ouvertes.fr/hal-00339779

]. S. Bvdhvl10a, R. Bhamidi, J. S. Van-der-hofstad, and . Van-leeuwaarden, Scaling limits for critical inhomogeneous random graphs with finite third moments, Electron. J. Probab, vol.15, issue.54, pp.1682-1703, 2010.

]. S. Bvdhvl10b, R. Bhamidi, J. S. Van-der-hofstad, and . Van-leeuwaarden, Novel scaling limits for critical inhomogeneous random graphs, 2010.

]. B. Bol84 and . Bollobás, The evolution of random graphs, Trans. Amer. Math. Soc, vol.286, issue.1, pp.257-274, 1984.

]. B. Bol01, Bollobás : Random graphs, volume 73 de Cambridge Studies in Advanced Mathematics, 2001.

D. [. Boucheron and . Gardy, An urn model from learning theory. Random Structures Algorithms, pp.43-67, 1997.

M. [. Britton, A. Deijfen, and . Martin-löf, Generating Simple Random Graphs with Prescribed Degree Distribution, Journal of Statistical Physics, vol.66, issue.6, pp.1377-1397, 2006.
DOI : 10.1007/s10955-006-9168-x

J. Bunge and M. Fitzpatrick, Estimating the Number of Species: A Review, Journal of the American Statistical Association, vol.21, issue.421, pp.364-373, 1993.
DOI : 10.1080/01621459.1993.10594330

[. Chern and H. Hwang, Partial Match Queries in Random Quadtrees, CJ11] N. Curien et A, pp.904-915178, 2003.
DOI : 10.1137/S0097539702412131

N. Curien and J. Gall, Random recursive triangulations of the disk via fragmentation theory Devroye : A note on the height of binary search trees, J. Assoc. Comput. Mach, vol.33, issue.3, pp.489-498, 1986.

]. L. Dev87 and . Devroye, Branching processes in the analysis of the heights of trees, Acta Inform, vol.24, issue.3, pp.277-298, 1987.

]. L. Dev99 and . Devroye, Universal limit laws for depths in random trees, SIAM J. Comput, vol.28, issue.2, pp.409-432, 1999.

A. [. Erd?s and . Rényi, On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl, vol.5, pp.17-61, 1960.

T. [. Ethier and . Kurtz, Markov processes Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics, 1986.

J. [. Finkel, . [. Bentley, G. Flajolet, C. Gonnet, J. M. Puech et al., Quad trees a data structure for retrieval on composite keys, Analytic variations on quadtrees. Algorithmica Laforest et B. Salvy : Hypergeometrics and the cost structure of quadtrees. Random Structures Algorithms, pp.1-9473, 1974.
DOI : 10.1007/BF00288933

R. [. Flajolet and . Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

]. D. Gar02 and . Gardy, Occupancy urn models in the analysis of algorithms, J. Statist. Plann. Inference, vol.101, issue.12, pp.95-105, 2002.

B. [. Gnedin, J. Hansen, and . Pitman, Notes on the occupancy problem with infinitely many boxes: general asymptotics and power laws, Probability Surveys, vol.4, issue.0, pp.146-171, 2007.
DOI : 10.1214/07-PS092

G. [. Haas, J. Miermont, M. Pitman, and . Winkel, Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic models, The Annals of Probability, vol.36, issue.5, pp.1790-1837, 2008.
DOI : 10.1214/07-AOP377
URL : https://hal.archives-ouvertes.fr/hal-00359720

M. [. Hatami and . Molloy, The scaling window for a random graph with a given degree sequence, ACM-SIAM Symposium on Discrete Algorithms, 2010.

K. [. He and . Gaston, Estimating Species Abundance from Occurrence, The American Naturalist, vol.156, issue.5, pp.553-559, 2000.
DOI : 10.1086/303403

]. L. Hol86 and . Holst, On birthday, collectors', occupancy and other classical urn problems, Internat. Statist. Rev, vol.54, issue.1, pp.15-27, 1986.

Y. Hu and Z. Shi, Minimal position and critical martingale convergence in branching random walks, and directed polymers on disordered trees, The Annals of Probability, vol.37, issue.2, pp.742-789, 2009.
DOI : 10.1214/08-AOP419
URL : https://hal.archives-ouvertes.fr/hal-00133596

A. Iserles and Y. Liu, Integro-differential Equations and Generalized Hypergeometric Functions, Journal of Mathematical Analysis and Applications, vol.208, issue.2, pp.404-424, 1997.
DOI : 10.1006/jmaa.1997.5322

J. Jacod and A. N. Shiryaev, Limit theorems for stochastic processes, de Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences, 2003.
DOI : 10.1007/978-3-662-02514-7

]. S. Jan08 and . Janson, The largest component in a subcritical random graph with a power law degree distribution, Ann. Appl. Probab, vol.18, issue.4, pp.1651-1668, 2008.

]. S. Jan09 and . Janson, The probability that a random multigraph is simple, Combin. Probab. Comput, vol.18, issue.12, pp.205-225, 2009.

D. [. Janson, T. Knuth, B. ?uczak, . [. Pittel, M. Janson et al., The birth of the giant component A new approach to the giant component problem : Urn models and their application, Series in Probability and Mathematical Statistics, pp.231-358197, 1977.

]. A. Jos11a and . Joseph, A phase transition for the heights of a fragmentation tree, 2011.

]. A. Jos11b and . Joseph, The component sizes of a critical random graph with given degree sequence, 2011.

M. Kang and T. G. 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

B. [. Kolchin and V. P. Sevastyanov, Chistyakov : Random allocations, Translated from the Russian, 1978.

]. Q. Liu97 and . Liu, Sur une équation fonctionnelle et ses applications: une extension du théorème de Kesten-Stigum concernant des processus de branchement, Adv. in Appl. Probab, vol.29, issue.2, pp.353-373, 1997.

]. Q. Liu01 and . Liu, Asymptotic properties and absolute continuity of laws stable by random weighted mean. Stochastic Process, Appl, vol.95, issue.1, pp.83-107, 2001.

]. T. ?uc90 and . ?uczak, Component behavior near the critical point of the random graph process. Random Structures Algorithms [McD95] McDiarmid : Minimal positions in a branching random walk, Ann. Appl. Probab, vol.1, issue.5, pp.287-310128, 1990.

R. [. Meyn, Tweedie : Markov chains and stochastic stability, 2009.

M. Molloy, 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

M. Molloy and B. , 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

J. [. Perman, M. Pitman, and . Yor, Size-biased sampling of Poisson point processes and excursions, Probability Theory and Related Fields, vol.28, issue.1, pp.21-39, 1992.
DOI : 10.1007/BF01205234

]. B. Pit84, Pittel : On growing random binary trees, J. Math. Anal. Appl, vol.103, issue.2, pp.461-480, 1984.

]. B. Pit08 and . Pittel, On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase, Ann. Appl. Probab, vol.18, issue.4, pp.1636-1650, 2008.

]. S. Res08 and . Resnick, Extreme values, regular variation and point processes . Springer Series in Operations Research and Financial Engineering, 2008.

J. M. Robson, The height of binary search trees, Austral. Comput. J, vol.11, issue.4, pp.151-153, 1979.
URL : https://hal.archives-ouvertes.fr/hal-00307160

]. T. Tur09 and . Turova, Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1. arXiv:0907.0897v2, 2009. [vdH10] R. van der Hofstad : Critical behavior in inhomogeneous random graphs, 2010.

]. N. Wor78 and . Wormald, Some Problems in the Enumeration of Labelled Graphs, Thèse de doctorat, 1978.