Universal scaling of distances in complex networks

Details Universal scaling of distances in complex networks Universal scaling of distances in complex networks

2004-11-05

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

Phys. Rev. E 72, 026108 (2005)

Physics

Condensed Matter

Disordered Systems and Neural Networks

4 pages, 3 figures, 1 table

Scientific paper

10.1103/PhysRevE.72.026108

Universal scaling of distances between vertices of Erdos-Renyi random graphs, scale-free Barabasi-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks are observed. A mean distance between two nodes of degrees k_i and k_j equals to =A-B log(k_i k_j). The scaling is valid over several decades. A simple theory for the appearance of this scaling is presented. Parameters A and B depend on the mean value of a node degree _nn calculated for the nearest neighbors and on network clustering coefficients.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-214947