Adaptive Dynamics of Realistic Small-World Networks

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.

[1]  Philippe Duchon,et al.  Towards small world emergence , 2006, SPAA '06.

[2]  Pierre Fraigniaud,et al.  A Doubling Dimension Threshold Theta(loglogn) for Augmented Graph Navigability , 2006, ESA.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  K. Soo.  Zipf's law for cities: a cross-country investigation , 2005 .

[5]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[6]  Aleksandrs Slivkins.  Distance estimation and object location via rings of neighbors , 2005, PODC '05.

[7]  M. Draief,et al.  Routing in Poisson small-world networks , 2005 .

[8]  Jasmine Novak,et al.  Theoretical Analysis of Geographic Routing in Social Networks , 2005 .

[9]  Pierre Fraigniaud,et al.  Greedy Routing in Tree-Decomposed Graphs , 2005, ESA.

[10]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[11]  David Liben-Nowell,et al.  An algorithmic approach to social networks , 2005 .

[12]  P. Fraigniaud.  A New Perspective on the Small-World Phenomenon: Greedy Routing in Tree-Decomposed Graphs , 2005 .

[13]  Lali Barrière,et al.  Efficient Routing in Networks with Long Range Contacts , 2001, DISC.

[14]  Cristopher Moore,et al.  How Do Networks Become Navigable , 2003 .

[15]  Béla Bollobás,et al.  The Diameter of a Cycle Plus a Random Matching , 1988, SIAM J. Discret. Math..

[16]  A. Ganesh,et al.  Efficient routeing in Poisson small-world networks , 2006, Journal of Applied Probability.

[17]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[18]  Oskar Sandberg,et al.  Double Clustering and Graph Navigability , 2007, ArXiv.

[19]  Oskar Sandberg,et al.  Neighbor Selection and Hitting Probability in Small-World Graphs , 2007, ArXiv.

[20]  Ian Clarke,et al.  The evolution of navigable small-world networks , 2006, ArXiv.

[21]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[22]  Harold M. Mayer,et al.  National Atlas of the United States. , 1958 .

[23]  Pierre Fraigniaud,et al.  Networks Become Navigable as Nodes Move and Forget , 2008, ICALP.

[24]  M.,et al.  Efficient routing in Poisson small-world networks , 2006 .

[25]  Jasmine Novak,et al.  Geographic routing in social networks , 2005, Proc. Natl. Acad. Sci. USA.

[26]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.