Adaptive Dynamics of Realistic Small-World Networks

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search in small-world networks, we conduct an experimental analysis of a dynamic algorithm that produces small-world networks. We find that the algorithm adapts robustly to a wide variety of situations in realistic geographic networks with synthetic test data and with real world data, even when vertices are uneven and non-homogeneously distributed. We investigate the same algorithm in the case where some vertices are more popular destinations for searches than others, for example obeying power-laws. We find that the algorithm adapts and adjusts the networks according to the distributions, leading to improved performance. The ability of the dynamic process to adapt and create small worlds in such diverse settings suggests a possible mechanism by which such networks appear in nature.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Adaptive Dynamics of Realistic 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 Adaptive Dynamics of Realistic Small-World Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Dynamics of Realistic Small-World Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-729997

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.