Please use this identifier to cite or link to this item:
Title: Universal features of network topology
Authors: Austin, K
Rodgers, G J
Issue Date: 2004
Publisher: Springer Berlin
Citation: Proceedings of 4th International Conference of Computational Science ICCS2004, Krakow, Poland, June 6-9, 2004. Lecture Notes in Computer Science, 3038 (Part III): 1054-1061,
Abstract: Recent studies have revealed characteristic general features in the topology of real-world networks. We investigate the universality of mechanisms that result in the power-law behaviour of many real-world networks, paying particular attention to the Barabasi-Albert process of preferential attachment as the most successful. We introduce a variation on this theme where at each time step either a new vertex and edge is added to the network or a new edge is created between two existing vertices. This process retains a power-law degree distribution, while other variations destroy it. We also introduce alternative models which favour connections to vertices with high degree but by a different mechanism and find that one of the models displays behaviour that is compatible with a power-law degree distribution.
ISSN: 978-3-540-22116-6
Appears in Collections:Mathematical Physics
Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
Universal Features.pdf313.68 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.