TY  - JOUR
A1  - Kim, Dong-Hee
A1  - Son, Seung-Woo
A1  - Ahn, Yong-Yeol
A1  - Kim, P.-J.
A1  - Eom, Young-Ho
A1  - Jeong, Hawoong
UR  - http://dx.doi.org/10.1143/PTPS.157.213
JF  - Progress of Theoretical Physics Supplement
Y1  - 2005///
PB  - Publication Office of Progress of Theoretical Physics
VL  - 157
ID  - eprints2378
EP  - 220
TI  - Underlying scale-free trees in complex networks
SP  - 213
N2  - 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. 
AV  - none
SN  - 0375-9687
ER  -