O. Bodini, A. Darrasse, H. Hwang, and M. Soria, The connectivity-profile of random increasing k-trees, Proceedings of ANALCO'10: Workshop on Analytic Algorithmics and Combinatorics, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00424863

[. Bárabasi and R. Albert, Emergence of scaling in random networks, Science, vol.286, pp.509-512, 1999.

R. [. Beineke and . Pippert, The number of labeled k-dimensional trees, Journal of Combinatorial Theory, vol.6, issue.2, pp.200-205, 1969.
DOI : 10.1016/S0021-9800(69)80120-1

O. [. Bollobás and . Riordan, Mathematical results on scale-free random graphs, Handbook of graphs and networks, pp.1-34, 2003.
DOI : 10.1002/3527602755.ch1

M. [. Darrasse and . 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

F. [. Flajolet, B. Bergeron, and . Salvy, Varieties of increasing trees, Lecture Notes in Computer Science, vol.581, pp.24-48, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00074977

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

]. Y. Gao09 and . Gao, The degree distribution of random k-trees, Theoretical Computer Science, vol.410, pp.688-695, 2009.

M. Kuba and A. Panholzer, On the degree distribution of the nodes in increasing trees, Journal of Combinatorial Theory, Series A, vol.114, issue.4, pp.597-618, 2007.
DOI : 10.1016/j.jcta.2006.08.003

H. M. Mahmoud, Evolution of random search trees, 1992.

J. W. Moon, The number of labeled k-trees, Journal of Combinatorial Theory, vol.6, issue.2, pp.196-199, 1969.
DOI : 10.1016/S0021-9800(69)80119-5

R. [. Mahmoud and . Smythe, A survey of recursive trees, Theoretical Probability and Mathematical Statistics, vol.51, pp.1-37, 1995.

A. Panholzer, Distribution of the Steiner Distance in Generalized M-ary Search Trees, Combinatorics, Probability and Computing, vol.13, issue.4-5, pp.717-733, 2004.
DOI : 10.1017/S0963548304006212

A. Panholzer and H. Prodinger, Level of nodes in increasing trees revisited, Random Structures and Algorithms, vol.29, issue.2, pp.203-226, 2007.
DOI : 10.1002/rsa.20161

S. [. Watts and . Strogatz, Collective dynamics of 'small-world' networks, Nature, vol.393, issue.6684, pp.440-442, 1998.
DOI : 10.1038/30918