Barabási, A.-L. and Álbert, R. (1999). Emergence of scaling in random networks. Science 286, 509–512.
Bollobás, B. (2001). Random Graphs, 2nd edn. Cambridge University Press.
Bollobás, B. and Riordan, O. M. (2003). Mathematical results on scale-free random graphs. In Handbook of Graphs and Networks, Wiley-VCH, Weinheim, pp. 1–34.
Bollobás, B., Riordan, O., Spencer, J. and Tusnády, G. (2001). The degree sequence of a scale-free random graph process. Random Structures Algorithms 18, 279–290.
Buckley, P. G. and Osthus, D. (2004). Popularity based random graph models leading to a scale-free degree sequence. Discrete Math. 282, 53–68.
Chung, F. and Lu, L. (2006). Complex Graphs and Networks. American Mathematical Society, Providence, RI.
Durrett, R. (2007). Random Graph Dynamics. Cambridge University Press.
Erdős, P. and Rényi, A. (1959). On random graphs. I. Publ. Math. Debrecen 6, 290–297.
Freedman, D. A. (1975). On tail probabilities for martingales. Ann. Prob. 3, 100–118.
Holme, P. and Kim, B. J. (2002). Growing scale-free networks with tunable clustering. Phys. Rev. E 65, 026107.
Janson, S., Łuczak, T. and Rucinski, A. (2000). Random Graphs. John Wiley, New York.
Kumar, R., et al. (2000). Stochastic models for the web graph. In Proceedings of the 41st Annual Symposium on the Foundations of Computer Science, IEEE, pp. 57–65.
Newman, M. E. J. (2010). Networks: An Introduction. Oxford University Press.
Ostroumova, L., Ryabchenko, A. and Samosvat, E. (2013). Generalized preferential attachment: Tunable power-law degree distribution and clustering coefficient. In Algorithms and Models for the Web Graph, Springer, Cham, pp. 185–202.
Watts, D. J. and Strogatz, S. H. (1998). Collective dynamics of 'small-world' networks. Nature 393, 440–442.