On the searchability of small-world networks with arbitrary underlying structure

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 389-398

  Fraigniaud, Pierre ^a   Giakkoupis, George ^a  

^a CNRS   (France)

Author keywords

decentralized search; small worlds; social networks

Indexed keywords

AUGMENTED GRAPH; DISTANCE-BASED; DOUBLING DIMENSIONS; GENERAL CLASS; GRAPH SIZES; GREEDY SEARCH; GREEDY SEARCH ALGORITHMS; LONG-RANGE CONNECTION; LOWER BOUNDS; NEXT-HOP; POLYLOGARITHMIC NUMBERS; SEARCH ALGORITHMS; SEARCHABILITY; SMALL WORLD NETWORKS; SMALL WORLDS; SOCIAL NETWORKS; SQUARE GRID;

AD HOC NETWORKS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; SOCIAL NETWORKING (ONLINE);

COMPUTATION THEORY;

EID: 77954711908     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806744     Document Type: Conference Paper

References (20)

1. I. Abraham and C. Gavoille. Object location using path separators. In Proc. 25th ACM Symp. on Principles of Distributed Computing (PODC), pages 188-197, 2006.
2. M. Dietzfelbinger and P. Woelfel. Tight lower bounds for greedy routing in uniform small world rings. In Proc. 41st ACM Symp. on Theory of Computing (STOC), pages 591-600, 2009.
3. P. S. Dodds, R. Muhamad, and D. J. Watts. An experimental study of search in global social networks. Science, 301:827-829, 2003.
4. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Could any graph be turned into a small-world? In Proc. 19th Int. Symp. on Distributed Computing (DISC), pages 511-513, 2005.
5. P. Fraigniaud. Greedy routing in tree-decomposed graphs. In Proc. 13th European Symp. on Algorithms (ESA), pages 791-802, 2005.
6. P. Fraigniaud, C. Gavoille, A. Kosowski, E. Lebhar, and Z. Lotker. Universal augmentation schemes for network navigability: Overcoming the √n-barrier. In Proc. 19th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 1-7, 2007.
7. P. Fraigniaud, C. Gavoille, and C. Paul. Eclecticism shrinks even small worlds. In Proc. 23rd ACM Symp. on Principles of Distributed Computing (PODC), pages 169-178, 2004.
8. P. Fraigniaud, E. Lebhar, and Z. Lotker. A lower bound for network navigability. SIAM J. Discrete Math., to appear.
9. (Preliminary version in Proc. 13th ESA, 2006.).
10. J. Kleinberg. The small-world phenomenon: An algorithm perspective. In Proc. 32nd ACM Symp. on Theory of Computing (STOC), pages 163-170, 2000.
11. J. Kleinberg. Small-world phenomena and the dynamics of information. In Proc. 15th Neural Information Processing Systems Conf. (NIPS), pages 431-438, 2001.
12. J. Kleinberg. Complex networks and decentralized search algorithms. In Proc. Int. Congress of Mathematicians (ICM), 2006.
13. E. Lebhar and N. Schabanel. Almost optimal decentralized routing in long-range contact networks. In Proc. 31st Int. Colloq. on Automata, Languages and Programming (ICALP), pages 894-905, 2004.
14. D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, and A. Tomkins. Geographic routing in social networks. Proc. National Academy of Sciences of the USA, 102(33):11623-11628, 2005.
15. G. S. Manku, M. Naor, and U. Wieder. Know thy neighbor's neighbor: The power of lookahead in randomized P2P networks. In Proc. 36th ACM Symp. on Theory of Computing (STOC), pages 54-63, 2004.
16. C. Martel and V. Nguyen. Analyzing Kleinberg's (and other) small-world models. In Proc. 23rd ACM Symp. on Principles of Distributed Computing (PODC), pages 179-188, 2004.
17. C. Martel and V. Nguyen. Analyzing and characterizing small-world graphs. In Proc. 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 311-320, 2005.
18. S. Milgram. The small world problem. Psychology Today, 67(1):60-67, 1967.
19. A. Slivkins. Distance estimation and object location via rings of neighbors. In Proc. 24th ACM Symp. on Principles of Distributed Computing (PODC), pages 41-50, 2005.
20. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998.