Transport in weighted networks: Partition into superhighways and roads

Details Transport in weighted networks: Partition into superhighways and roads Transport in weighted networks: Partition into superhighways and roads

2005-11-22

arxiv.org/abs/cond-mat/0511525v2

Phys. Rev. Lett. 96, 148702 (2006)

Physics

Condensed Matter

Disordered Systems and Neural Networks

12 pages, 5 figures

Scientific paper

10.1103/PhysRevLett.96.148702

Transport in weighted networks is dominated by the minimum spanning tree (MST), the tree connecting all nodes with the minimum total weight. We find that the MST can be partitioned into two distinct components, having significantly different transport properties, characterized by centrality -- number of times a node (or link) is used by transport paths. One component, the {\it superhighways}, is the infinite incipient percolation cluster; for which we find that nodes (or links) with high centrality dominate. For the other component, {\it roads}, which includes the remaining nodes, low centrality nodes dominate. We find also that the distribution of the centrality for the infinite incipient percolation cluster satisfies a power law, with an exponent smaller than that for the entire MST. The significance of this finding is that one can improve significantly the global transport by improving a tiny fraction of the network, the superhighways.

Affiliated with

Also associated with

No associations

Rating

Transport in weighted networks: Partition into superhighways and roads 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 Transport in weighted networks: Partition into superhighways and roads, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transport in weighted networks: Partition into superhighways and roads will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-384822