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.
Kim
Dong-Hee
DH
Department of Physics, Korea Advanced Institute of Science and Technology, Daejeon 305-701, Korea.
Noh
Jae Dong
JD
Jeong
Hawoong
H