Random Networks Growing Under a Diameter Constraint

Details Random Networks Growing Under a Diameter Constraint Random Networks Growing Under a Diameter Constraint

2003-01-04

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

Physics

Condensed Matter

Statistical Mechanics

5 pages, 4 figures

Scientific paper

We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree distribution then that distribution must be approximately scale-free with an exponent between 2 and 3. The diameter constraint can be interpreted as an environmental selection pressure that may help explain the scale-free nature of graphs for which data is available at different times in their growth. Two examples include graphs representing evolved biological pathways in cells and the topology of the Internet backbone. Our assumptions and explanation are found to be consistent with these data.

Affiliated with

Also associated with

No associations

Rating

Random Networks Growing Under a Diameter Constraint 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 Random Networks Growing Under a Diameter Constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Networks Growing Under a Diameter Constraint will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-289727