Abstract
In this article we study a class of randomly grown graphs that includes some preferential attachment and uniform attachment models, as well as some evolving graph models that have been discussed previously in the literature. The degree distribution is assumed to form a Markov chain; this gives a particularly simple form for a stochastic recursion of the degree distribution. We show that for this class of models the empirical degree distribution tends almost surely and in norm to the expected degree distribution as the size of the graph grows to infinity and we provide a simple asymptotic expression for the expected degree distribution. Convergence of the empirical degree distribution has consequences for statistical analysis of network data in that it allows the full data to be summarized by the degree distribution of the nodes without losing the ability to obtain consistent estimates of parameters describing the network.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barabási, A.L., Albert, R., 1999. Emergence of scaling in random networks. Science, 286 509–512.
Barabási, A.L., Oltvai, Z.N., 2004. Network biology: Understanding the cell's functional organization. Nat. Rev. Genet. 5, 101–113.
Bollobás, B., Janson, S., Riordan, O., 2004. The phase transition in the uniformly grown random graph has infinite order. Random Struct. Algorithms 26(1–2), 1–36.
Bollobás, B., Riordan, O., Spencer, J., Tusnady, G., 2001. The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18(3), 279–290.
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J., 2000. Graph structure in the web. Random Comput. Netw. 33(3), 309–320.
Burda, Z., Diaz-Correia, J., Krzywicki, A., 2001. Statistical ensemble of scale-free random graphs. Phys. Rev. E 64, 046118.
Cooper, C., Frieze, A., 2003. A general model of web Graphs. Random Struct. Algorithms 22(3), 311–335.
Dorogovtsev, S.N., Mendes, J.F.F., 2003. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, Oxford.
Fellegi, I.P., 1963. Sampling with varying probabilities without replacement: Rotating and non-rotating samples. J. Am. Stat. Assoc. 58, 183–201.
Grimmet, G.R., Stirzaker, D.R., 1992. Probability and Random Processes. 2nd edn. Oxford University Press, Oxford.
Kumar, S.R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E., 2000. Stochastic models for the web graph. Proc. 41st Ann. Symp. Found. Comput. Sci. 57–65.
Kumar, S.R., Raghavan, P., Rajagopalan, S., Tomkins, A., 1999. Trawling the web for emerging cyber-communities. Proc. Intl. Conf. Comb. Comput., 1–18.
Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., Alon, U., 2004. Superfamilies of evolved and designed networks. Science 303, 1538–1542.
Rice, J.J, Kershenbaum, A., Stolovitzky, G., 2005. Lasting impressions: Motifs in protein–protein maps may provide footprints of evolutionary events. Proc. Natl. Acad. Sci., 102(9), 3173–3174.
Shiryaev, A.N., 1996. Probability, 2nd edn. Spinger-Verlag, Berlin.
Stumpf, M.P.H., Ingram, P.J., Nouvel, I., Wiuf, C., 2005. Statistical model selection methods applied to biological network data. Trans. Comput. Sys. Biol. 3, 65–77.
Wiuf, C., Brameier, M., Hagberg, O., Stumpf, M.P.H., 2005. A likelihood approch to analysis of network data, PNAS, to appear.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hagberg, O., Wiuf, C. Convergence properties of the degree distribution of some growing network models. Bull. Math. Biol. 68, 1275–1291 (2006). https://doi.org/10.1007/s11538-006-9085-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11538-006-9085-9