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!
cited_by cdi_FETCH-LOGICAL-c394t-b6c3160e7969b5e4c8c4805a9c91f8f601fd14abd30235c7f175f13eb4e3b9c03
cites cdi_FETCH-LOGICAL-c394t-b6c3160e7969b5e4c8c4805a9c91f8f601fd14abd30235c7f175f13eb4e3b9c03
container_end_page 314
container_issue 2
container_start_page 308
container_title Europhysics letters
container_volume 72
creator Macdonald, P. J
Almaas, E
Barabási, A.-L
description 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.
doi_str_mv 10.1209/epl/i2005-10232-x
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1209_epl_i2005_10232_x</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29862944</sourcerecordid><originalsourceid>FETCH-LOGICAL-c394t-b6c3160e7969b5e4c8c4805a9c91f8f601fd14abd30235c7f175f13eb4e3b9c03</originalsourceid><addsrcrecordid>eNqNkEtLAzEUhYMoWKs_wN2sXBmb9yRLKdYHLSL4ADdhJr2pY-dlMqX13zu2xbWrC4fvHC4fQueUXFFGzAjaclQwQiSmhHGGNwdoQJlWWGgpDtGAMCOxJKk8RicxfhJCqaZqgNSsqItqVSWxzeq6qBdJFwBi0vhkDcXio4N5El1WAvZ9ntTQrZuwjKfoyGdlhLP9HaKXyc3z-A5PH2_vx9dT7LgRHc6V41QRSI0yuQThtBOayMw4Q732ilA_pyLL57x_WrrU01R6yiEXwHPjCB-ii91uG5qvFcTOVkV0UJZZDc0qWma0YkaIHqQ70IUmxgDetqGosvBtKbG_hmxvyG4N2a0hu-k7eNcpYgebv0IWllalPJVWkzc7YU_vD2yW2teev9zzTfuP-R-MzXdr</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29862944</pqid></control><display><type>article</type><title>Minimum spanning trees of weighted scale-free networks</title><source>Institute of Physics</source><creator>Macdonald, P. J ; Almaas, E ; Barabási, A.-L</creator><creatorcontrib>Macdonald, P. J ; Almaas, E ; Barabási, A.-L</creatorcontrib><description>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.</description><identifier>ISSN: 0295-5075</identifier><identifier>EISSN: 1286-4854</identifier><identifier>DOI: 10.1209/epl/i2005-10232-x</identifier><language>eng</language><publisher>IOP Publishing</publisher><subject>89.20.Hh ; 89.75.Fb ; 89.75.Hc</subject><ispartof>Europhysics letters, 2005-10, Vol.72 (2), p.308-314</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c394t-b6c3160e7969b5e4c8c4805a9c91f8f601fd14abd30235c7f175f13eb4e3b9c03</citedby><cites>FETCH-LOGICAL-c394t-b6c3160e7969b5e4c8c4805a9c91f8f601fd14abd30235c7f175f13eb4e3b9c03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Macdonald, P. J</creatorcontrib><creatorcontrib>Almaas, E</creatorcontrib><creatorcontrib>Barabási, A.-L</creatorcontrib><title>Minimum spanning trees of weighted scale-free networks</title><title>Europhysics letters</title><description>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.</description><subject>89.20.Hh</subject><subject>89.75.Fb</subject><subject>89.75.Hc</subject><issn>0295-5075</issn><issn>1286-4854</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNqNkEtLAzEUhYMoWKs_wN2sXBmb9yRLKdYHLSL4ADdhJr2pY-dlMqX13zu2xbWrC4fvHC4fQueUXFFGzAjaclQwQiSmhHGGNwdoQJlWWGgpDtGAMCOxJKk8RicxfhJCqaZqgNSsqItqVSWxzeq6qBdJFwBi0vhkDcXio4N5El1WAvZ9ntTQrZuwjKfoyGdlhLP9HaKXyc3z-A5PH2_vx9dT7LgRHc6V41QRSI0yuQThtBOayMw4Q732ilA_pyLL57x_WrrU01R6yiEXwHPjCB-ii91uG5qvFcTOVkV0UJZZDc0qWma0YkaIHqQ70IUmxgDetqGosvBtKbG_hmxvyG4N2a0hu-k7eNcpYgebv0IWllalPJVWkzc7YU_vD2yW2teev9zzTfuP-R-MzXdr</recordid><startdate>20051001</startdate><enddate>20051001</enddate><creator>Macdonald, P. J</creator><creator>Almaas, E</creator><creator>Barabási, A.-L</creator><general>IOP Publishing</general><general>EDP Sciences</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7U5</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>20051001</creationdate><title>Minimum spanning trees of weighted scale-free networks</title><author>Macdonald, P. J ; Almaas, E ; Barabási, A.-L</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c394t-b6c3160e7969b5e4c8c4805a9c91f8f601fd14abd30235c7f175f13eb4e3b9c03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>89.20.Hh</topic><topic>89.75.Fb</topic><topic>89.75.Hc</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Macdonald, P. J</creatorcontrib><creatorcontrib>Almaas, E</creatorcontrib><creatorcontrib>Barabási, A.-L</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>Europhysics letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Macdonald, P. J</au><au>Almaas, E</au><au>Barabási, A.-L</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Minimum spanning trees of weighted scale-free networks</atitle><jtitle>Europhysics letters</jtitle><date>2005-10-01</date><risdate>2005</risdate><volume>72</volume><issue>2</issue><spage>308</spage><epage>314</epage><pages>308-314</pages><issn>0295-5075</issn><eissn>1286-4854</eissn><abstract>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.</abstract><pub>IOP Publishing</pub><doi>10.1209/epl/i2005-10232-x</doi><tpages>7</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0295-5075
ispartof Europhysics letters, 2005-10, Vol.72 (2), p.308-314
issn 0295-5075
1286-4854
language eng
recordid cdi_crossref_primary_10_1209_epl_i2005_10232_x
source Institute of Physics
subjects 89.20.Hh
89.75.Fb
89.75.Hc
title Minimum spanning trees of weighted scale-free networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T08%3A36%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Minimum%20spanning%20trees%20of%20weighted%20scale-free%20networks&rft.jtitle=Europhysics%20letters&rft.au=Macdonald,%20P.%20J&rft.date=2005-10-01&rft.volume=72&rft.issue=2&rft.spage=308&rft.epage=314&rft.pages=308-314&rft.issn=0295-5075&rft.eissn=1286-4854&rft_id=info:doi/10.1209/epl/i2005-10232-x&rft_dat=%3Cproquest_cross%3E29862944%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c394t-b6c3160e7969b5e4c8c4805a9c91f8f601fd14abd30235c7f175f13eb4e3b9c03%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=29862944&rft_id=info:pmid/&rfr_iscdi=true