Minimum spanning trees of weighted scale-free networks

A complete characterization of real networks requires us to understand the consequences of the uneven interaction strengths between a system's components. Here we use minimum spanning trees (MSTs) to explore the effect of correlations between link weights and network topology on scale-free netw...

Full description

Saved in:
Bibliographic Details
Published in:Europhysics letters 2005-10, Vol.72 (2), p.308-314
Main Authors: Macdonald, P. J, Almaas, E, Barabási, A.-L
Format: Article
Language:English
Subjects:
89.20.Hh
89.75.Fb
89.75.Hc
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A complete characterization of real networks requires us to understand the consequences of the uneven interaction strengths between a system's components. Here we use minimum spanning trees (MSTs) to explore the effect of correlations between link weights and network topology on scale-free networks. Solely by changing the nature of the correlations between weights and network topology, the structure of the MSTs can change from scale-free to exponential. Additionally, for some choices of weight correlations, the efficiency of the MSTs increases with increasing network size, a result with potential implications for the design and scalability of communication networks.
ISSN:0295-5075
1286-4854
DOI:10.1209/epl/i2005-10232-x