Analysis of weighted networks

Details Analysis of weighted networks Analysis of weighted networks

2004-07-20

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

Phys. Rev. E 70, 056131 (2004)

Physics

Condensed Matter

Statistical Mechanics

9 pages, 3 figures

Scientific paper

10.1103/PhysRevE.70.056131

The connections in many networks are not merely binary entities, either present or not, but have associated weights that record their strengths relative to one another. Recent studies of networks have, by and large, steered clear of such weighted networks, which are often perceived as being harder to analyze than their unweighted counterparts. Here we point out that weighted networks can in many cases be analyzed using a simple mapping from a weighted network to an unweighted multigraph, allowing us to apply standard techniques for unweighted graphs to weighted ones as well. We give a number of examples of the method, including an algorithm for detecting community structure in weighted networks and a new and simple proof of the max-flow/min-cut theorem.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-142897