The evolution of navigable small-world networks

Details The evolution of navigable small-world networks The evolution of navigable small-world networks

2006-07-07

arxiv.org/abs/cs/0607025v1

Computer Science

Data Structures and Algorithms

Scientific paper

Small-world networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for small-world networks, with one of the most fruitful, introduced by Jon Kleinberg, showing in which type of graphs it is possible to route, or navigate, between vertices with very little knowledge of the graph itself. Kleinberg's model is static, with random edges added to a fixed grid. In this paper we introduce, analyze and test a randomized algorithm which successively rewires a graph with every application. The resulting process gives a model for the evolution of small-world networks with properties similar to those studied by Kleinberg.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96440