Navigating low-dimensional and hierarchical population networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 480-491

  Kumar, Ravi ^a   Liben Nowell, David ^b   Tomkins, Andrew ^a  

^a YAHOO RESEARCH   (United States)

^b CARLETON COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MOTION PLANNING; PHASE SPACE METHODS; PROBABILITY;

GREEDY ROUTING; POPULATION DENSITIES; SOCIAL NETWORKS;

HIERARCHICAL SYSTEMS;

EID: 33750719107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_44     Document Type: Conference Paper

References (31)

1. L. Adamic, E. Adar. How to search a social network. Social Networks, 27(3):187-203, 2005.
2. L. Adamic, R. Lukose, B. Huberman. Local search in unstructured networks. In Handbook of Graphs and Networks. Wiley-VCH, 2002.
3. L. Adamic, R. Lukose, A. Puniyani, B. Huberman, Search in power-law networks. Physical Review Letters E, 64(046135), 2001.
4. L. Barrière, P. Praigniaud, E. Kranakis, D. Krizanc. Efficient routing in networks with long range contacts. In Proc. Intl. Conf. on Distr. Comp., 2001.
5. E. Demaine, J. Iacono, S. Langerman. Proximate point searching. Computational Geometry: Theory and Applications, 28(1):29-40, 2004.
6. P. Dodds, R. Muhamad, D. Watts. An experimental study of search in global social networks. Science, 301:827-829, 2003.
7. P. Duchon, N. Hanusse, E. Lebhar, N. Schabanel. Could any graph be turned into a small world? Theoretical Computer Science, 355(1):96-103, 2006.
8. P. Fraigniaud, Greedy routing in tree-decomposed graphs, In Proc. Eur. Symp. Alg., 2005.
9. P. Fraigniaud, C. Gavoille, C. Paul. Eclecticism shrinks even small worlds. In Proc. Symp. on Princ. of Distr. Comp., 2004.
10. J. Iacono, S. Langerman. Proximate planar point location. In Proc. Symp. on Comp. Geom., 2003.
11. B. Karp. Geographic Routing for Wireless Networks, PhD thesis, Harvard, 2000.
12. B. Karp, H. Kung, GPSR: Greedy perimeter stateless routing for wireless networks. In Proc. Intl. Conf. on Mobile Computing and Networking, 2000.
13. B. Kim, C. Yoon, S. Han, H. Jeong. Path finding strategies in scale-free networks. Physical Review Letters E, 65(027103), 2002.
14. Y. Kim, R. Govindan, B. Karp, S. Shenker. Geographic routing made practical. In Proc. Symp. on Networked Systems Design and Impl., 2005.
15. J. Kleinberg. Navigation in a small world. Nature, 406:845, 2000.
16. J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. Symp. Theory of Comp., 2000.
17. J. Kleinberg. Small-world phenomena and the dynamics of information. In Advances in Neural Information Processing, 2001.
18. J. Kleinberg. Complex networks and decentralized search algorithms. In Proc. International Congress of Mathematicians, 2006.
19. R. Kumar, D. Liben-Nowell, J. Novak, P. Raghavan, A. Tomkins. Theoretical analysis of geographic routing in social networks. TR MIT-CSAIL-TR-2005-040.
20. E. Lebhar, N. Schabanel. Close to optimal decentralized routing in long-range contact networks. In Proc. Intl. Colloq. on Automata, Lang., and Prog., 2004.
21. D. Liben-Nowell, J. Novak, R. Kumar, P. Raghavan, A. Tomkins. Geographic routing in social networks. Proc. Natl. Acad. Sciences, 102(33):11623-11628, 2005.
22. G. Manku, M. Naor, U. Wieder. Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. In Proc. Symp. Theory of Comp., 2004.
23. C. Martel, V. Nguyen. Analyzing Kleinberg's (and other) small-world models. In Proc. Symp. on Princ. of Distr. Comp., 2004.
24. S. Milgram. The small world problem. Psychology Today, 1:61-67, 1967.
25. R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge Univ. Press, 1995.
26. V. Nguyen, C. Martel. Analyzing and characterizing small-world graphs. In Proc. Symp. on Disc. Alg., 2005.
27. O, Şimşek, D. Jensen. A probabilistic framework for decentralized search in networks. In Proc. Intl. Joint Conf. on AI, 2005.
28. A. Slivkins. Distance estimation and object location via rings of neighbors. In Proc. Symp. on Princ. of Distr. Comp., 2005.
29. S. Wasserman, K. Faust, Social Network Analysis. Cambridge Univ. Press, 1994.
30. D. Watts, P. Dodds, M. Newman. Identity and search in social networks. Science, 296:1302-1305, 2002.
31. D. Watts, S. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998.