This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
D. Aldous (1991). The continuum random tree. I. Ann. Prob.
D. Aldous (1993). The continuum random tree. III. Ann. Prob.
T. Antunović , E. Mossel and M. Z. Rácz (2016). Coexistence in preferential attachment networks. Combinatorics Prob. Comput.
N. Berger , C. Borgs , J. T. Chayes and A. Saberi (2014). Asymptotic behavior and distributional limits of preferential attachment graphs. Ann. Prob.
B. Bollobás , O. Riordan , J. Spencer and G. Tusnády (2001). The degree sequence of a scale-free random graph process. Random Structures Algorithms
S. Bubeck , E. Mossel and M. Z. Rácz (2015). On the influence of the seed graph in the preferential attachment model. IEEE Trans. Network Sci. Eng.
A. Collevecchio , C. Cotar and M. LiCalzi (2013). On a preferential attachment and generalized Polya's urn model. Ann. Appl. Prob.
N. Curien , T. Duquesne , I. Kortchemski and I. Manolescu (2015). Scaling limits and influence of the seed graph in preferential attachment trees. J. Éc. Polytech. Math.
L. Goldstein and G. Reinert (2013). Stein's method for the beta distribution and the Pólya–Eggenberger urn. J. Appl. Prob.
S. Janson (2006). Limit theorems for triangular urn schemes. Prob. Theory Relat. Fields
P. L. Krapivsky , S. Redner and F. Leyvraz (2000). Connectivity of growing random networks. Phys. Rev. Lett.
T. F. Móri (2005). The maximum degree of the Barabási–Albert random tree. Combinatorics Prob. Comput.
M. E. J. Newman (2003). The structure and function of complex networks. SIAM Rev.
E. A. Peköz , A. Röllin and N. Ross (2013). Degree asymptotics with rates for preferential attachment random graphs. Ann. Appl. Prob.
E. A. Peköz , A. Röllin and N. Ross (2013). Total variation error bounds for geometric approximation. Bernoulli
R. Pemantle (2007). A survey of random processes with reinforcement. Prob. Surveys
J. Pitman (1999). Brownian motion, bridge, excursion, and meander characterized by sampling at independent uniform times. Electron. J. Prob.
N. Ross (2013). Power laws in preferential attachment graphs and Stein's method for the negative binomial distribution. Adv. Appl. Prob.
A. Rudas , B. Tóth and B. Valkó (2007). Random trees and general branching processes. Random Structures Algorithms