Abstract
We consider a random network evolving in continuous time in which new nodes are born and old may die, and where undirected edges between nodes are created randomly and may also disappear. The node population is Markovian and so is the creation and deletion of edges, given the node population. Each node is equipped with a random social index and the intensity at which a node creates new edges is proportional to the social index, and the neighbour is either chosen uniformly or proportional to its social index in a modification of the model. We derive properties of the network as time and the node population tends to infinity. In particular, the degree-distribution is shown to be a mixed Poisson distribution which may exhibit a heavy tail (e.g. power-law) if the social index distribution has a heavy tail. The limiting results are verified by means of simulations, and the model is fitted to a network of sexual contacts.
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.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Bianconi, G., Barabási, A.-L.: Competition and multiscaling in evolving networks. Europhys. Lett. 54, 436–442 (2001)
Bollobás, B., Spencer, J., Riordan, O., Tusnády, G.: The degree sequence of a scale-free random graph process. Random Struct. Algorithms 18, 279–290 (2001)
Bollobás, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31, 3–122 (2007)
Bollobás, B., Janson, S., Riordan, O.: Sparse random graphs with clustering. Isaac Newton Institute preprint, NI08030-CSM (2008)
Cami, A., Deo, N.: Techniques for analyzing dynamic random graph models for web-like networks: an overview. Networks 51, 211–255 (2008)
Cooper, C., Frieze, A.: A general model of web graphs. Random Struct. Algorithms 22, 311–335 (2003)
Cooper, C., Frieze, A., Vera, J.: Random deletion in a scale-free random graph process. Internet Math. 1(4), 463–483 (2004)
Chung, F., Lu, L., Dewey, T.G., Galas, D.J.: Duplication models for biological networks. J. Comput. Biol. 10(5), 677–687 (2003)
Deo, N., Cami, A.: Preferential deletion in dynamic models of web-like networks. Inf. Process. Lett. 102, 156–162 (2007)
Feller, W.: An introduction to probability theory and its applications, vol. 1, 3rd edn. Wiley, Singapore (1968)
Haccou, P., Jagers, P., Vatutin, V.A.: Branching Processes: Variation, Growth, and Extinction of Populations. Cambridge University Press, Cambridge (2005)
Lewin, B. (ed.): Sex in Sweden: On the sexual life in Sweden 1996. Folkhälsoinstitutet, Stockholm (1998) (in Swedish)
Liljeros, F., Edling, C.R., Amaral, L.A.N., Stanley, H.E., Aberg, Y.: The web of human sexual contacts. Nature 411, 907–908 (2001)
Newman, M.: The structure and function of complex networks. SIAM Rev. 45, 167–256 (2003)
Ross, S.M.: Probability Models, 8th edn. Academic Press, New York (2003)
Turova, T.S.: Dynamical random graphs with memory. Phys. Rev. E 65, 066102 (2002)
Turova, T.S.: Long paths and cycles in dynamical graphs. J. Stat. Phys. 110(1/2), 385–417 (2003)
Turova, T.S.: Phase transitions in dynamical random graphs. J. Stat. Phys. 123(5), 1007–1032 (2006)
Turova, T.S.: Continuity of the percolation threshold in randomly grown graphs. Electron. J. Probab. 12(36), 1036–1047 (2007)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Britton, T., Lindholm, M. Dynamic Random Networks in Dynamic Populations. J Stat Phys 139, 518–535 (2010). https://doi.org/10.1007/s10955-010-9952-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-010-9952-5