Self-organized emergence of navigability on small-world networks

We study the origin of navigability in small-world (SW) networks and propose a general scheme for navigating SW networks. We find that navigability can naturally emerge from self-organization in the absence of prior knowledge about the underlying reference frames of networks. Through a process of information exchange and accumulation on networks, a hidden metric space for navigation on networks is constructed. Navigation based on distances between vertices in the hidden metric space can efficiently deliver messages on SW networks, in which long-range connections play an important role. Numerical simulations further demonstrate that a high cluster coefficient and a low diameter are both necessary for navigability. These interesting results provide profound insights into scalable routing on the Internet due to its distributed and localized requirements.

[1]  S. Redner,et al.  Organization of growing random networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Marián Boguñá,et al.  Navigating ultrasmall worlds in ultrashort time. , 2008, Physical review letters.

[3]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[4]  Marián Boguñá,et al.  Self-similarity of complex networks and hidden metric spaces , 2007, Physical review letters.

[5]  Dmitri V. Krioukov,et al.  Erratum: Self-Similarity of Complex Networks and Hidden Metric Spaces [Phys. Rev. Lett. 100, 078701 (2008)] , 2008 .

[6]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[7]  Stanley Milgram,et al.  An Experimental Study of the Small World Problem , 1969 .

[8]  Amin Vahdat,et al.  Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces , 2009, SIGMETRICS Perform. Evaluation Rev..

[9]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[10]  Mikkel Thorup,et al.  Compact name-independent routing with minimum stretch , 2008, ACM Trans. Algorithms.

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

[12]  Lada A. Adamic,et al.  How to search a social network , 2005, Soc. Networks.

[13]  Lenore Cowen,et al.  Compact Routing on Power Law Graphs with Additive Stretch , 2006, ALENEX.

[14]  Paul Francis,et al.  An architecture for a global Internet host distance estimation service , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[15]  Oskar Sandberg,et al.  Distributed Routing in Small-World Networks , 2006, ALENEX.

[16]  Marián Boguñá,et al.  Navigability of Complex Networks , 2007, ArXiv.

[17]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[18]  Adilson E Motter,et al.  Large-scale structural organization of social networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  D. Watts,et al.  An Experimental Study of Search in Global Social Networks , 2003, Science.

[20]  G. Caldarelli,et al.  Detecting communities in large networks , 2004, cond-mat/0402499.

[21]  Noam Berger,et al.  The diameter of long-range percolation clusters on finite cycles , 2001, Random Struct. Algorithms.

[22]  Adilson E Motter,et al.  Searching in small-world networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[24]  M. Newman,et al.  Vertex similarity in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

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

[27]  M. Frans Kaashoek,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM 2004.