. Jr, H. J. Andrade, R. F. Herrmann, L. R. Andrade, and . Da-silva, Apollonian networks: Simultaneously Scale-Free, small world, euclidean, space filling, and with matching graphs, Physical Review Letters, vol.94, issue.1, pp.18702-18706, 2005.

S. Arnborg, D. G. Corneil, and A. Proskurowski, -Tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.
DOI : 10.1137/0608024

S. Arya, M. J. Golin, and K. Mehlhorn, On the Expected Depth of Random Circuits, Combinatorics, Probability and Computing, vol.8, issue.3, pp.209-228, 1999.
DOI : 10.1017/S096354839900382X

A. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999.

W. Lowell, R. E. Beineke, and . Pippert, The number of labeled k-dimensional trees, Journal of Combinatorial Theory, vol.6, issue.2, pp.200-205, 1969.

S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. Hwang, Complex networks: Structure and dynamics, Physics Reports, vol.424, issue.4-5, pp.4-5175, 2006.
DOI : 10.1016/j.physrep.2005.10.009

B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády, The degree sequence of a scalefree random graph process. Random Structures and Algorithms, pp.279-290, 2001.

B. Chauvin, T. Klein, J. Marckert, and A. Rouault, Martingales and Profile of Binary Search Trees, Electronic Journal of Probability, vol.10, issue.0, pp.420-435, 2005.
DOI : 10.1214/EJP.v10-257
URL : https://hal.archives-ouvertes.fr/hal-00138808

H. Hua-huai-chern, T. Hwang, and . Tsai, An asymptotic theory for Cauchy???Euler differential equations with applications to the analysis of algorithms, Journal of Algorithms, vol.44, issue.1, pp.177-225, 2002.
DOI : 10.1016/S0196-6774(02)00208-0

F. Bergeron, P. Flajolet, and B. Salvy, Varieties of increasing trees, CAAP '92, pp.24-48, 1992.
DOI : 10.1007/3-540-55251-0_2
URL : https://hal.archives-ouvertes.fr/inria-00074977

A. Darrasse and M. Soria, Limiting Distribution for Distances in k-Trees, Proceedings of the 20th International Workshop on Combinatorial Algorithms Lecture Notes in Computer Science, 2009.
DOI : 10.1007/978-3-642-10217-2_19
URL : https://hal.archives-ouvertes.fr/hal-00391815

A. Darrasse, M. Soria, and O. Bodini, A unifying structural approach to the analysis of parameters in k-trees

L. Devroye and S. Janson, Long and short paths in uniform random recursive dags, Arkiv f??r Matematik, vol.49, issue.1, 2009.
DOI : 10.1007/s11512-009-0118-0

M. Drmota, Random Trees, 2009.
DOI : 10.1007/978-3-211-75357-6
URL : https://hal.archives-ouvertes.fr/inria-00001281

M. Drmota and B. Gittenberger, On the profile of random trees. Random Structures and Algorithms, pp.421-451, 1997.

M. Drmota, S. Janson, and R. Neininger, A functional limit theorem for the profile of search trees, The Annals of Applied Probability, vol.18, issue.1, pp.288-333, 2008.
DOI : 10.1214/07-AAP457

R. Durrett, Random Graph Dynamics Number 20 in Cambridge Series in Statistical and Probabilistic Mathematics, 2006.

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

M. Fuchs, H. Hwang, and R. Neininger, Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees, Algorithmica, vol.46, issue.3-4, pp.367-407, 2006.
DOI : 10.1007/s00453-006-0109-5

Y. Gao, The degree distribution of random <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-trees, Theoretical Computer Science, vol.410, issue.8-10, pp.688-695, 2009.
DOI : 10.1016/j.tcs.2008.10.015

H. Hwang, Profiles of random trees: Plane-oriented recursive trees. Random Structures and Algorithms, pp.380-413, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01184033

G. Labelle, C. Lamathe, and P. Leroux, Labelled and unlabelled enumeration of k-gonal 2-trees, Journal of Combinatorial Theory, Series A, vol.106, issue.2, pp.193-219, 2004.
DOI : 10.1016/j.jcta.2004.01.009

J. Marckert and M. Albenque, Some families of increasing planar maps, Electronic Journal of Probability, vol.13, pp.1624-1671, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00193880

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

E. J. Mark and . Newman, The structure and function of complex networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.

M. Edgar, R. C. Palmer, and . Read, On the number of plane 2-Trees, J. London Math. Soc, issue.4, pp.2-6583, 1973.

G. Park, H. Hwang, P. Nicodeme, and W. Szpankowski, Profiles of Tries, SIAM Journal on Computing, vol.38, issue.5, p.1821, 2009.
DOI : 10.1137/070685531

A. Proskurowski, K-trees: representation and distances, Congressus Numerantium, pp.785-794, 1980.

D. J. Rose, On simple characterizations of k-trees, Discrete Mathematics, vol.7, issue.3-4, pp.317-322, 1974.
DOI : 10.1016/0012-365X(74)90042-9

W. and R. Stevens, Chapter 8, traceroute program, TCP/IP Illustrated, 1994.

F. Viger, B. Augustin, X. Cuvellier, C. Magnien, M. Latapy et al., Detection, understanding, and prevention of traceroute measurement artifacts, Computer Networks, vol.52, issue.5, pp.998-1018, 2008.
DOI : 10.1016/j.comnet.2007.11.017
URL : https://hal.archives-ouvertes.fr/hal-01151782

Z. Zhang, L. Rong, and F. Comellas, High-dimensional random apollonian networks . Physica A: Statistical Mechanics and its Applications, pp.610-618, 2006.
DOI : 10.1016/j.physa.2005.09.042
URL : http://arxiv.org/abs/cond-mat/0502591