eprintid: 2378
rev_number: 6
eprint_status: archive
userid: 6
dir: disk0/00/00/23/78
datestamp: 2014-12-02 14:12:11
lastmod: 2014-12-18 13:57:58
status_changed: 2014-12-02 14:12:11
type: article
metadata_visibility: show
creators_name: Kim, Dong-Hee
creators_name: Son, Seung-Woo
creators_name: Ahn, Yong-Yeol
creators_name: Kim, P.-J.
creators_name: Eom, Young-Ho
creators_name: Jeong, Hawoong
creators_id: 
creators_id: 
creators_id: 
creators_id: 
creators_id: youngho.eom@imtlucca.it
creators_id: 
title: Underlying scale-free trees in complex networks
ispublished: pub
subjects: QC
divisions: CSA
full_text_status: none
abstract: We investigate the properties of two relatively different spanning trees of complex networks, so-called “communication kernel" and “response network". First, for the communication kernel, we construct spanning trees carrying a maximum total weight of edges that is given by average traffic, which is defined as edge betweenness centrality. It is found that the resulting spanning tree plays an important role in communication between vertices. We also find that the degree distribution of spanning trees shows scale-free behavior for many model and real-world networks and the degree of the spanning trees has strong correlation with their original network topology. For the response network, we launch an attack on a single vertex which can drastically change the communication pattern between vertices of networks. By using minimum spanning tree technique, we construct the response network based on the measurement of the betweenness centrality changes due to a vertex removal. We find that the degree distribution of the response network indicates the scale-free behavior as well as that of the communication kernel. Interestingly, these two minimum spanning trees from different methods not only have same scale-free behavior but overlap each other in their structures. This fact indicates that the complex network has a concrete skeleton, scale-free tree, as a basic structure. 
date: 2005
date_type: published
publication: Progress of Theoretical Physics Supplement
volume: 157
publisher: Publication Office of Progress of Theoretical Physics
pagerange: 213-220
id_number: doi:10.1143/PTPS.157.213
refereed: TRUE
issn: 0375-9687
official_url: http://dx.doi.org/10.1143/PTPS.157.213
citation:   Kim, Dong-Hee and Son, Seung-Woo and Ahn, Yong-Yeol and Kim, P.-J. and Eom, Young-Ho and Jeong, Hawoong  Underlying scale-free trees in complex networks.  Progress of Theoretical Physics Supplement, 157.  pp. 213-220.  ISSN 0375-9687      (2005)