Scale-free trees: The skeletons of complex networks

We investigate the properties of the spanning trees of various real-world and model networks. The spanning tree representing the communication kernel of the original network is determined by maximizing the total weight of the edges, whose weights are given by the edge betweenness centralities. We find that a scale-free tree and shortcuts organize a complex network. Especially, in ubiquitous scale-free networks, it is found that the scale-free spanning tree shows very robust betweenness centrality distributions and the remaining shortcuts characterize the properties of the original network, such as the clustering coefficient and the classification of scale-free networks by the betweenness centrality distribution.
Publisher
AMER PHYSICAL SOC
Issue Date
2004-10
Language
ENG
Keywords

CENTRALITY; EVOLUTION; INTERNET

Citation

PHYSICAL REVIEW E, v.70, no.4

ISSN
1539-3755
DOI
10.1103/PhysRevE.70.046126
URI
http://hdl.handle.net/10203/2264
Appears in Collection
PH-Journal Papers(저널논문)
Files in This Item
Scale-free trees The skeletons of complex networks(정하웅 교수님).pdf(74.38 kB)Download
  • Hit : 473
  • Download : 416
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 56 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0