L. Addario-berry and N. Broutin, Total progeny in killed branching random walk. Probability Theory and Related Fields, pp.265-295, 2011.
DOI : 10.1007/s00440-010-0299-2
URL : https://hal.archives-ouvertes.fr/hal-01220798

L. Addario-berry, N. Broutin, L. Devroye, and G. Lugosi, On combinatorial testing problems. The Annals of Statistics, pp.3063-309210, 2010.

L. Addario-berry, N. Broutin, and C. Goldschmidt, Critical Random Graphs: Limiting Constructions and Distributional Properties, Electronic Journal of Probability, vol.15, issue.0, pp.741-775, 2010.
DOI : 10.1214/EJP.v15-772
URL : http://arxiv.org/abs/0908.3629

L. Addario-berry, N. Broutin, and C. Goldschmidt, The continuum limit of critical random graphs. Probability Theory and Related Fields, pp.367-406, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00773370

L. Addario-berry, N. Broutin, C. Goldschmidt, and G. Miermont, The scaling limit of the minimum spanning tree of the complete graph, submitted, pp.60-2013

L. Addario-berry, N. Broutin, and C. Holmgren, Cutting down trees with a Markov chainsaw, The Annals of Applied Probability, vol.24, issue.6, 2011.
DOI : 10.1214/13-AAP978
URL : https://hal.archives-ouvertes.fr/hal-00773364

L. Addario-berry, N. Broutin, and G. Lugosi, Effective resistance of random trees, The Annals of Applied Probability, vol.19, issue.3, pp.1092-110710, 2009.
DOI : 10.1214/08-AAP572

L. Addario-berry, N. Broutin, G. Lugosip9-]-l, N. Addario-berry, B. Broutin et al., The Longest Minimum-Weight Path in a Complete Graph, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees Combinatorics and Probability, volume AG of DMTCS Proc, pp.1-19, 2006.
DOI : 10.1017/S0963548399003892

L. Addario-berry, N. Broutin, and B. Reed, Critical random graphs and the structure of a minimum spanning tree. Random Structures Algorithms, pp.323-347, 2009.

N. Broutin and L. Devroye, Large Deviations for the Weighted Height of an Extended Class of Trees, Algorithmica, vol.46, issue.3-4, pp.271-297, 2006.
DOI : 10.1007/s00453-006-0112-x

N. Broutin and L. Devroye, The height of list tries and TST, International Conference on Analysis of Algorithms, volume AH of DMTCS Proceedings, pp.271-282, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01184784

N. Broutin, L. Devroye, L. Devroye, N. Fraiman, and G. Lugosi, An analysis of the height of tries with random weights on the edges Connectivity threshold for Bluetooth graphs. Random Structures and Algorithms, to appear, Combinatorics, Probability and Computing, pp.161-202, 2008.

N. Broutin, L. Devroye, and E. Mcleish, Weighted height of random trees, Acta Informatica, vol.13, issue.1???2, pp.237-277, 2008.
DOI : 10.1007/s00236-008-0069-0

N. Broutin, L. Devroye, and E. Mcleish, Note on the Structure of Kruskal???s Algorithm, Algorithmica, vol.36, issue.1, pp.141-156, 2010.
DOI : 10.1007/s00453-008-9164-4

N. Broutin, L. Devroye, E. Mcleish, and M. De-la-salle, The height of increasing trees. Random Structures and Algorithms, pp.494-518, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01219519

N. Broutin and O. Fawzi, Longest Path Distance in Random Circuits, Combinatorics, Probability and Computing, vol.21, issue.06, pp.856-881, 2008.
DOI : 10.1007/s00453-001-0044-4
URL : https://hal.archives-ouvertes.fr/hal-00773368

N. Broutin and P. Flajolet, The distribution of height and diameter in random non-plane binary trees, Random Structures & Algorithms, vol.4, issue.2, pp.215-252, 2012.
DOI : 10.1002/rsa.20393
URL : https://hal.archives-ouvertes.fr/hal-00773369

N. Broutin and C. Holmgren, The total path length of split trees, The Annals of Applied Probability, vol.22, issue.5, pp.1745-177710, 2012.
DOI : 10.1214/11-AAP812
URL : https://hal.archives-ouvertes.fr/hal-00773367

N. Broutin and J. Marckert, Asymptotics of trees with a prescribed degree sequence and applications . Random Structures and Algorithms, to appear

N. Broutin, R. Neininger, and H. Sulzbach, Partial match queries in random quadtrees, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1056-1065, 2012.
DOI : 10.1137/1.9781611973099.83
URL : https://hal.archives-ouvertes.fr/hal-00773365

N. Broutin, R. Neininger, and H. Sulzbach, A limit process for partial match queries in random quadtrees. The Annals of Applied Probability, to appear, pp.1202-1342, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00773363

N. Broutin and H. Sulzbach, The dual tree of a recursive triangulation of the disk, The Annals of Probability, vol.43, issue.2, 2012.
DOI : 10.1214/13-AOP894
URL : https://hal.archives-ouvertes.fr/hal-00773362

R. Abraham and J. Delmas, The forest associated with the record process on a L??vy tree, Stochastic Processes and their Applications, vol.123, issue.9
DOI : 10.1016/j.spa.2013.04.017

L. Addario-berry, Random Structures & Algorithms The random walk construction of uniform spanning trees and uniform labelled trees [4] D. Aldous. The continuum random tree II: an overview Asymptotic fringe distibutions for general families of random trees [6] D. Aldous. The continuum random tree. I. The Annals of Probability [7] D. Aldous. The continuum random tree III. The Annals of Probability Recursive self-similarity for random trees, random triangulations and Brownian excursion. The Annals of Probability, Stochastic Analysis, pp.253-261450, 1990.

D. Aldous, Brownian excursions, critical random graphs and the multiplicative coalescent. The Annals of Probability, pp.812-854, 1997.

D. Aldous and J. Pitman, Brownian bridge asymptotics for random mappings. Random Structures and Algorithms, pp.487-512, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00102164

D. Aldous and J. Pitman, The standart additive coalescent. The Annals of Probability, pp.1703-1726, 1998.

D. Aldous and J. M. Steele, The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence, Discrete and Combinatorial Probability, pp.1-72, 2003.
DOI : 10.1007/978-3-662-09444-0_1

D. J. Aldous and B. Pittel, On a random graph with immigrating vertices: Emergence of the giant component. Random Structures and Algorithms, pp.79-102, 2000.

K. B. Athreya and P. E. Ney, Branching Processes, 1972.
DOI : 10.1007/978-3-642-65371-1

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

N. Berestycki, Recent progress in coalescent theory, Ensaios Matematicos, vol.16, pp.1-193, 2009.

J. Bertoin, A fragmentation process connected to Brownian motion. Probability Theory and Related Fields, pp.289-301, 2000.

J. Bertoin, Random fragmentation and coagulation processes, 2006.
DOI : 10.1017/CBO9780511617768
URL : https://hal.archives-ouvertes.fr/hal-00103015

J. Bertoin and A. 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 G. Miermont, Asymptotics in Knuth's parking problem for caravans, Random Structures and Algorithms, vol.3, issue.1, pp.38-55, 2006.
DOI : 10.1002/rsa.20092

J. Bertoin and J. Pitman, Path transformations connecting Brownian bridge, excursion and meander, Bull. Sci. Math, vol.118, pp.147-166, 1994.

J. Bertoin, Fire on trees. arXiv:1011.2308v2 [math, 2011.

J. Bertoin and G. Miermont, The cut-tree of large Galton???Watson trees and the Brownian CRT, The Annals of Applied Probability, vol.23, issue.4, 2012.
DOI : 10.1214/12-AAP877
URL : https://hal.archives-ouvertes.fr/hal-00661574

S. Bhamidi, R. Van-der-hofstad, and J. S. Van-leeuwaarden, Novel scaling limits for critical inhomogeneous random graphs, The Annals of Probability, vol.40, issue.6, 2009.
DOI : 10.1214/11-AOP680

S. Bhamidi, R. Van-der-hofstad, and J. S. Van-leeuwaarden, Scaling Limits for Critical Inhomogeneous Random Graphs with Finite Third Moments, Electronic Journal of Probability, vol.15, issue.0, 2012.
DOI : 10.1214/EJP.v15-817

B. Bollobás, The evolution of random graphs. Transactions of the, pp.257-274, 1984.

B. Bollobás, Random Graphs. Cambridge Studies in Advanced Mathematics, 2001.

B. Bollobás, A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs, European Journal of Combinatorics, vol.1, issue.4, pp.311-316, 1980.
DOI : 10.1016/S0195-6698(80)80030-8

A. Broder, Generating random spanning trees, 30th Annual Symposium on Foundations of Computer Science, pp.442-447, 1989.
DOI : 10.1109/SFCS.1989.63516

P. Chassaing and G. Louchard, Phase transition for parking blocks, Brownian excursion and coalescence. Random Structures & Algorithms, pp.76-119, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00003777

P. Chassaing and R. Marchand, Merging costs for the additive Marcus?Lushnikov process, and union-find algorithms. arXiv:math, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00001664

N. Curien and A. Joseph, Partial match queries in two-dimensional quadtrees: a probabilistic approach, Advances in Applied Probability, vol.9, issue.01, pp.178-194, 2011.
DOI : 10.1137/S0097539702412131
URL : https://hal.archives-ouvertes.fr/hal-00518352

N. Curien and J. Gall, Random recursive triangulation of the disk via fragmentation theory. The Annals of Probability, pp.2224-2270, 2011.

N. G. De-bruijn, D. E. Knuth, and S. Rice, THE AVERAGE HEIGHT OF PLANTED PLANE TREES, Graph Theory and Computing, pp.15-22, 1972.
DOI : 10.1016/B978-1-4832-3187-7.50007-6

M. Drmota and B. Gittenberger, The shape of unlabeled rooted random trees, European Journal of Combinatorics, vol.31, issue.8, pp.2028-2063, 2010.
DOI : 10.1016/j.ejc.2010.05.011

T. Duquesne and J. Gall, Random trees, Levy processes and spacial branching processes, volume 281 of Asterisque, 2002.

T. Duquesne and J. Gall, Probabilistic and fractal aspects of Lévy trees. Probability Theory and Related Fields, pp.553-603, 2005.

R. T. Durrett and D. L. Iglehart, Functionals of Brownian meander and Brownian excursion. The Annals of Probability, pp.130-135, 1977.

F. Eggenberger and G. Pólya, ??ber die Statistik verketteter Vorg??nge, Zeitschrift fur Angewandte Mathematik und Mechanik, pp.279-289, 1923.
DOI : 10.1002/zamm.19230030407

P. Erd?-os and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci, vol.5, pp.17-61, 1960.

S. N. Evans, Probability and real trees, École d'Été de Probabilités de Saint-Flour XXXV-2005, Lecture Notes in Mathematics, 1920.

K. Falconer, Fractal Geometry: Mathematical Foundations and Applications, 1990.
DOI : 10.1002/0470013850

W. Feller, An Introduction to Probability Theory and its Applications, volume II, 1971.

J. A. Fill, N. Kapur, and A. Panholzer, Destruction of Very Simple Trees, Algorithmica, vol.46, issue.3-4, pp.345-366, 2006.
DOI : 10.1007/s00453-006-0100-1

R. A. Finkel and J. L. Bentley, Quad trees a data structure for retrieval on composite keys, Acta Informatica, vol.4, issue.1, pp.1-19, 1974.
DOI : 10.1007/BF00288933

P. Flajolet and A. Odlyzko, The average height of binary trees and other simple trees, Journal of Computer and System Sciences, vol.25, issue.2, pp.171-213, 1982.
DOI : 10.1016/0022-0000(82)90004-6
URL : https://hal.archives-ouvertes.fr/inria-00076505

P. Flajolet and A. Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.216-240, 1990.
DOI : 10.1137/0403019
URL : https://hal.archives-ouvertes.fr/inria-00075725

P. Flajolet and C. Puech, Partial match retrieval of multidimensional data, Journal of the ACM, vol.33, issue.2, pp.371-407, 1986.
DOI : 10.1145/5383.5453
URL : https://hal.archives-ouvertes.fr/inria-00076325

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

P. Flajolet, G. H. Gonnet, C. Puech, and J. M. Robson, Analytic variations on quadtrees, Algorithmica, vol.32, issue.4, pp.473-500, 1993.
DOI : 10.1007/BF01891833
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.6772

P. Flajolet, G. Labelle, L. Laforest, and B. Salvy, Hypergeometrics and the cost structure of quadtrees. Random Structures and Algorithms, pp.117-144, 1995.
URL : https://hal.archives-ouvertes.fr/inria-00074422

A. Frieze and C. Mcdiarmid, Algorithmic theory of random graphs. Random Structures and Algorithms, pp.5-42, 1997.

B. Gittenberger and V. Kraus, The degree profile of random P??lya trees, Journal of Combinatorial Theory, Series A, vol.119, issue.7, pp.1528-1557, 2012.
DOI : 10.1016/j.jcta.2012.04.007

C. Goldschmidt, Critical random hypergraphs: The emergence of a giant set of identifiable vertices. The Annals of Probability, pp.1573-1600, 2005.

M. Gromov, Metric Structures for Riemannian and Non-Riemannian Spaces, 1999.

B. Haas and G. Miermont, The Genealogy of Self-similar Fragmentations with Negative Index as a Continuum Random Tree, Electronic Journal of Probability, vol.9, issue.0, pp.57-97, 2004.
DOI : 10.1214/EJP.v9-187
URL : https://hal.archives-ouvertes.fr/hal-00000995

B. Haas and G. Miermont, Scaling limits of Markov branching trees with applications to Galton?Watson and random unordered trees. The Annals of Probability, pp.2589-2666, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00464337

F. Harary and E. M. Palmer, Graphical Enumeration, 1973.
DOI : 10.1007/bfb0066432

T. E. Harris, The Theory of Branching Processes, 1963.
DOI : 10.1007/978-3-642-51866-9

P. C. Hemmer, The random parking problem, Journal of Statistical Physics, vol.15, issue.3-4, pp.865-869, 1989.
DOI : 10.1007/BF01022837

R. Van-der-hofstad, Critical behavior in inhomogeneous random graphs. Random Structures and Algorithms, 2012.

S. Janson, Random Records and Cuttings in Complete Binary Trees, Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probability (Vienna), pp.242-253, 2004.
DOI : 10.1007/978-3-0348-7915-6_24

S. Janson, Random cutting and records in deterministic and random trees, Random Structures and Algorithms, vol.12, issue.2, pp.139-179, 2006.
DOI : 10.1002/rsa.20086

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

S. Janson, T. ?uczak, and A. Ruci´nskiruci´nski, Random Graphs, 2000.
DOI : 10.1002/9781118032718

A. Joseph, The component sizes of a critical random graph with pre-described degree sequence. ArXiv:1012.2352 [math, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00545815

D. P. Kennedy, The distribution of the maximum Brownian excursion, Journal of Applied Probability, vol.13, issue.02, pp.371-376, 1976.
DOI : 10.1007/BF00535106

H. Kesten, The incipient infinite cluster in two-dimensional percolation. Probability theory and related fields, pp.369-394, 1986.

I. Kortchemski, Invariance principles for Galton???Watson trees conditioned on the number of leaves, Stochastic Processes and their Applications, pp.3126-3172, 2012.
DOI : 10.1016/j.spa.2012.05.013

M. Kuba and A. Panholzer, Isolating a Leaf in Rooted Trees via Random Cuttings, Annals of Combinatorics, vol.12, issue.1, pp.81-99, 2008.
DOI : 10.1007/s00026-008-0338-1

M. Kuba and A. Panholzer, Isolating nodes in recursive trees, Aequationes mathematicae, vol.76, issue.3, pp.258-280, 2008.
DOI : 10.1007/s00010-008-2929-7

J. Gall, The uniform random tree in a Brownian excursion. Probability Theory and Related Fields, pp.369-383, 1993.

J. Gall, Random trees and applications, Probability Surveys, vol.2, issue.0, pp.245-311, 2005.
DOI : 10.1214/154957805100000140

J. Gall, Random real trees Annales de la faculté des sciences de Toulouse Ser, pp.35-62, 2006.

J. Gall and Y. Le, Branching processes in Levy processes: The exploration process. The Annals of Probability, pp.213-252, 1998.

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 random graphs at the point of transition. Transactions of the, pp.721-748, 1994.

J. Marckert and G. Miermont, The CRT is the scaling limit of unordered binary trees, Random Structures & Algorithms, vol.49, issue.4, pp.467-501, 2011.
DOI : 10.1002/rsa.20332
URL : https://hal.archives-ouvertes.fr/hal-00364487

J. Marckert and A. Mokkadem, The depth first processes of Galton?watson trees converge to the same Brownian excursion. The Annals of Probability, pp.1655-1678, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00307494

C. Martínez, A. Panholzer, and H. Prodinger, Partial match queries in relaxed multidimensional search trees, Algorithmica, vol.7, issue.1, pp.181-204, 2001.
DOI : 10.1007/BF02679618

A. Meir and J. W. Moon, Cutting down random trees, Journal of the Australian Mathematical Society, vol.38, issue.03, pp.313-324, 1970.
DOI : 10.1112/jlms/s1-33.4.471

A. Meir and J. W. Moon, Cutting down recursive trees, Mathematical Biosciences, vol.21, issue.3-4, pp.173-181, 1974.
DOI : 10.1016/0025-5564(74)90013-3

A. Meir and J. W. Moon, On the altitude of nodes in random trees, Journal canadien de math??matiques, vol.30, issue.5, pp.997-1015, 1978.
DOI : 10.4153/CJM-1978-085-0

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

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

A. Nachmias and Y. Peres, Critical percolation on random regular graphs. Random Structures & Algorithms, pp.111-148, 2010.

R. Neininger, Asymptotic distributions for partial match queries in K-d trees. Random Structures and Algorithms, pp.403-427, 2000.

R. Neininger and L. Rüschendorf, Limit laws for partial match queries in quadtrees, The Annals of Applied Probability, vol.11, issue.2, pp.452-469, 2001.
DOI : 10.1214/aoap/1015345300

R. Neininger and H. Sulzbach, On a functional contraction method, The Annals of Probability, vol.43, issue.4, 2012.
DOI : 10.1214/14-AOP919

R. Otter, The Number of Trees, The Annals of Mathematics, vol.49, issue.3, pp.583-599, 1948.
DOI : 10.2307/1969046

A. Panholzer, Non-crossing trees revisited: cutting down and spanning subtrees, Discrete random walks volume AC of DMTCS, pp.265-276, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01183922

A. Panholzer, Cutting down very simple trees, Quaestiones Mathematicae, vol.29, issue.2, pp.211-228, 2006.
DOI : 10.2989/16073600609486160

J. Pitman, Coalescent Random Forests, Journal of Combinatorial Theory, Series A, vol.85, issue.2, pp.165-193, 1999.
DOI : 10.1006/jcta.1998.2919

J. Pitman, Combinatorial stochastic processes, Lecture Notes in Mathematics, vol.1875, 2006.

G. Pólya, Kombinatorische Anzahlbestimmungen f??r Gruppen, Graphen und chemische Verbindungen, Acta Mathematica, vol.68, issue.0, pp.145-254, 1937.
DOI : 10.1007/BF02546665

G. Pólya and R. C. Read, Combinatorial enumeration of groups, graphs and chemical compounds, 1987.
DOI : 10.1007/978-1-4612-4664-0

A. Rényi, On a one-dimensional problem concering random space-filling, Publ. Math. Inst. Hungar. Acad. Sci, vol.3, pp.109-127, 1958.

A. Rényi and G. Szekeres, On the height of trees, Journal of the Australian Mathematical Society, vol.4, issue.04, pp.497-507, 1967.
DOI : 10.1007/BF02559539

O. Riordan, The Phase Transition in the Configuration Model, Combinatorics, Probability and Computing, vol.21, issue.1-2, 2011.
DOI : 10.1017/S0963548311000666

D. Rizzolo, Scaling limits of Markov branching trees and Galton???Watson trees conditioned on the number of vertices with out-degree in a given set, Annales de l'Institut Henri Poincar??, Probabilit??s et Statistiques, vol.51, issue.2, 2011.
DOI : 10.1214/13-AIHP594

D. W. Stroock, Probability Theory -An Analytic View, 2011.

T. S. Turova, Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1., Random Structures & Algorithms, vol.20, issue.4, 2009.
DOI : 10.1002/rsa.20503