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

Authors:
Hongwei Luo;Kathy Horadam
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;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
Venue:
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Year:
2008

Citing 4
Cited 0

A critical point for random graphs with a given degree sequence

Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
Regular Article: The Diameter of Sparse Random Graphs

Advances in Applied Mathematics
A general model of web graphs

Random Structures & Algorithms
The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

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.