R. Albert and A. Barabási, Statistical mechanics of complex networks, Reviews of Modern Physics, vol.74, issue.1, pp.47-97, 2002.
DOI : 10.1103/RevModPhys.74.47

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

B. Bollobás and O. Riordan, The Diameter of a Scale-Free Random Graph, Combinatorica, vol.24, issue.1, pp.5-34, 2004.
DOI : 10.1007/s00493-004-0002-2

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

P. Flajolet and A. M. 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 M. Soria, General combinatorial schemas: Gaussian limit distributions and exponential tails, Discrete Mathematics, vol.114, issue.1-3, pp.159-180, 1993.
DOI : 10.1016/0012-365X(93)90364-Y
URL : https://hal.archives-ouvertes.fr/inria-00075557

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, R. T. Smythe, and J. Szyma´nskiszyma´nski, On the structure of random plane-oriented recursive trees and their branches. Random Structures Algorithms, pp.151-176, 1993.