Simulation and Measurement of Complex Network Growth: the Interplay of Uniform and Preferential Attachment

Issue title: Workshop on Combinatorial Algorithms

Article type: Research Article

Authors: Luo, Hongwei | Horadam, Kathy

Affiliations: School of Mathematical and Geospatial Sciences, RMIT University, Melbourne VIC 3001, Australia. E-mails: hongwei.luo@rmit.edu.au; kathy.horadam@ems.rmit.edu.au

Abstract: The main discovery of the paper is the introduction and study of a new U-P complex network model, which aims to describe and analyze many common-featured real-world complex networks. This model employs a new functional form of the network growth rule: a linear combination of preferential and uniform attachment. In particular, the degree distribution of the model is first studied by using the computer simulation method, while the exact solution is also obtained analytically.

Keywords: Complex networks, Scale-free, Small-world, Preferential attachment

Journal: Fundamenta Informaticae, vol. 84, no. 1, pp. 61-79, 2008