Metric structure of random networks

Details Metric structure of random networks Metric structure of random networks

2002-10-03

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

Nucl. Phys. B 653, 307 (2003)

Physics

Condensed Matter

Statistical Mechanics

24 pages, 5 figures

Scientific paper

10.1016/S0550-3213(02)01119-7

We propose a consistent approach to the statistics of the shortest paths in random graphs with a given degree distribution. This approach goes further than a usual tree ansatz and rigorously accounts for loops in a network. We calculate the distribution of shortest-path lengths (intervertex distances) in these networks and a number of related characteristics for the networks with various degree distributions. We show that in the large network limit this extremely narrow intervertex distance distribution has a finite width while the mean intervertex distance grows with the size of a network. The size dependence of the mean intervertex distance is discussed in various situations.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-24641