Depth of Field and Cautious-Greedy Routing in Social Networks

Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship--where the probability that person u befriends person v is inversely proportional to the number of people who are closer to u than v is--is an empirically validated model of acquaintanceship that provably results in efficient decentralized search via greedy routing, even in networks with variable population densities. In this paper, we introduce cautious-greedy routing, a variant of greedy that avoids taking large jumps unless they make substantial progress towards the target. Our main result is that cautious-greedy routing finds a path of short expected length from an arbitrary source to a randomly chosen target, independent of the population densities. To quantify the expected length of the path, we define the depth of field of a metric space, a new quantity that intuitively measures the "width" of directions that leave a point in the space. Our main result is that cautious-greedy routing finds a path of expected length O(log2 n) in n-person networks that have aspect ratio polynomial in n, bounded doubling dimension, and bounded depth of field. Specifically, in k-dimensional grids under Manhattan distance with arbitrary population densities, the O(log2 n) expected path length that we achieve with the cautious-greedy algorithm improves the best previous bound of O(log3 n) with greedy routing.

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

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

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

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

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

[6]  David D. Jensen,et al.  Decentralized Search in Networks Using Homophily and Degree Disparity , 2005, IJCAI.

[7]  Mahesh K. Marina,et al.  Performance of route caching strategies in Dynamic Source Routing , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[8]  R. Richardson The International Congress of Mathematicians , 1932, Science.

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

[10]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[11]  Andrew V. Goldberg,et al.  Routing in Networks with Low Doubling Dimension , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

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

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

[14]  Ittai Abraham,et al.  Local embeddings of metric spaces , 2007, STOC '07.

[15]  Philippe Duchon,et al.  Could any Graph be Turned into a Small-World? , 2005, DISC.

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

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

[18]  Moni Naor,et al.  Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.

[19]  Nicolas Schabanel,et al.  Almost Optimal Decentralized Routing in Long-Range Contact Networks , 2004, ICALP.

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

[21]  Karl Aberer,et al.  On Small World Graphs in Non-uniformly Distributed Key Spaces , 2005, 21st International Conference on Data Engineering Workshops (ICDEW'05).

[22]  Andrew Tomkins,et al.  Navigating Low-Dimensional and Hierarchical Population Networks , 2006, ESA.

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

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

[25]  Pierre Fraigniaud,et al.  A doubling dimension threshold Θ(log log n) for augmented graph navigability , 2006 .

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

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