Geographic routing in social networks

We live in a "small world," where two arbitrary people are likely connected by a short chain of intermediate friends. With scant information about a target individual, people can successively forward a message along such a chain. Experimental studies have verified this property in real social networks, and theoretical models have been advanced to explain it. However, existing theoretical models have not been shown to capture behavior in real-world social networks. Here, we introduce a richer model relating geography and social-network friendship, in which the probability of befriending a particular person is inversely proportional to the number of closer people. In a large social network, we show that one-third of the friendships are independent of geography and the remainder exhibit the proposed relationship. Further, we prove analytically that short chains can be discovered in every network exhibiting the relationship.

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

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

[3]  Noga Alon,et al.  A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..

[4]  Pamela J. Hinds,et al.  Distributed Work , 2002 .

[5]  S. Milgram,et al.  Acquaintance Networks Between Racial Groups: Application of the Small World Method. , 1970 .

[6]  Pierre Fraigniaud,et al.  Eclecticism shrinks even small worlds , 2004, PODC.

[7]  M. Newman,et al.  Scaling and percolation in the small-world network model. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[8]  Michael T. Gastner,et al.  The spatial structure of networks , 2006 .

[9]  F. H. Newell,et al.  United States Geological Survey , 1900, Nature.

[10]  Kenneth J. Arrow,et al.  Information Dynamics in the Networked World , 2003, Inf. Syst. Frontiers.

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

[12]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Hawoong Jeong,et al.  Modeling the Internet's large-scale topology , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Charles U. Martel,et al.  Analyzing Kleinberg's (and other) small-world Models , 2004, PODC '04.

[15]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[16]  Charles U. Martel,et al.  Analyzing and characterizing small-world graphs , 2005, SODA '05.

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

[18]  P. Killworth,et al.  The reversal small-world experiment , 1978 .

[19]  John Scott.  What is social network analysis , 2010 .

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

[21]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[22]  Rajendra Kulkarni,et al.  Spatial Small Worlds: New Geographic Patterns for an Information Economy , 2003 .

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

[24]  Michael Mitzenmacher,et al.  A Brief History of Generative Models for Power Law and Lognormal Distributions , 2004, Internet Math..

[25]  Gábor Csányi,et al.  Fractal-small-world dichotomy in real-world networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[28]  Frances Cairncross,et al.  The death of distance , 1997 .

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

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

[31]  Lada A. Adamic,et al.  Local Search in Unstructured Networks , 2002, ArXiv.

[32]  M. Mitzenmacher.  A brief history of lognormal and power law distributions , 2001 .

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

[34]  Leonard E. Miller,et al.  Distribution of Link Distances in a Wireless Network , 2001, Journal of research of the National Institute of Standards and Technology.

[35]  Beom Jun Kim,et al.  Path finding strategies in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

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

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

[39]  Sajal K. Das,et al.  Proceedings of the 6th international conference on Distributed Computing , 2004 .