Quick search Find article
Quick search
Find article

Minimum spanning trees of weighted scale-free networks

P. J. Macdonald, E. Almaas and A.-L. Barabási

Show affiliations


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.


PACS

89.20.Hh World Wide Web, Internet

89.75.Hc Networks and genealogical trees

89.75.Fb Structures and organization in complex systems

Subjects

Statistical physics and nonlinear systems

Dates

Issue 2 (October 2005)

Received 18 July 2005, accepted for publication 26 August 2005

Published 14 September 2005



Related review articles

What's this?
View review articles related to this research to gain an insight into the key trends in this subject area. Related review articles are selected based on PACS/MSC codes, and are no more than three years old.

  1. RFID sensors as the common sensing platform for single-use biopharmaceutical manufacturing
  2. Progress in engineering high strain lead-free piezoelectric ceramics
  3. Plasmas for spacecraft propulsion

View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.