corner
corner

Phys. Rev. E 68, 066124 (2003) [24 pages]

Stochastically evolving networks

Download: PDF (246 kB) Buy this article Export: BibTeX or EndNote (RIS)

Derek Y. C. Chan*, Barry D. Hughes, and Alex S. Leong
Particulate Fluids Processing Centre, Department of Mathematics and Statistics, The University of Melbourne, Victoria 3010, Australia

William J. Reed
Department of Mathematics and Statistics, University of Victoria, Victoria, British Columbia, Canada V8W 3P4

Received 4 June 2003; published 31 December 2003

We discuss a class of models for the evolution of networks in which new nodes are recruited into the network at random times, and links between existing nodes that are not yet directly connected may also form at random times. The class contains both models that produce “small-world” networks and less tightly linked models. We produce both trees, appropriate in certain biological applications, and networks in which closed loops can appear, which model communication networks and networks of human sexual interactions. One of our models is closely related to random recursive trees, and some exact results known in that context can be exploited. The other models are more subtle and difficult to analyze. Our analysis includes a number of exact results for moments, correlations, and distributions of coordination number and network size. We report simulations and also discuss some mean-field approximations. If the system has evolved for a long time and the state of a random node (which thus has a random age) is observed, power-law distributions for properties of the system arise in some of these models.

© 2003 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevE.68.066124
DOI:
10.1103/PhysRevE.68.066124
PACS:
89.75.Fb, 89.75.Da, 89.75.Hc

*Email address: D.Chan@ms.unimelb.edu.au

Email address: B.Hughes@ms.unimelb.edu.au

Email address: reed@math.uvic.ca