Scale-free trees: the skeletons of complex networks

Details Scale-free trees: the skeletons of complex networks Scale-free trees: the skeletons of complex networks

2004-03-30

arxiv.org/abs/cond-mat/0403719v1

Phys. Rev. E 70, 046126 (2004).

Physics

Condensed Matter

Statistical Mechanics

Scientific paper

10.1103/PhysRevE.70.046126

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 total weight of edges, whose weights are given by the edge betweenness centralities. We find that a scale-free tree and shortcuts organize a complex network. The spanning tree shows robust betweenness centrality distribution that was observed in scale-free tree models. It turns out that the shortcut distribution characterizes the properties of original network, such as the clustering coefficient and the classification of networks by the betweenness centrality distribution.

Affiliated with

Also associated with

No associations

Rating

Scale-free trees: the skeletons of complex networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scale-free trees: the skeletons of complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scale-free trees: the skeletons of complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-78502