Universal features of network topology

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Austin, K., & Rodgers, G. J. (2004). Universal features of network topology. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3038, 1054–1061. https://doi.org/10.1007/978-3-540-24688-6_136

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free