Complex networks and decentralized search algorithms

International Congress of Mathematicians, ICM 2006

Volumn 3, Issue , 2006, Pages 1019-1044

  Kleinberg, Jon ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Complex networks; Random graphs; Search algorithms; Social network analysis

Indexed keywords

DECENTRALIZED SEARCHES; LARGE-SCALE NETWORK; PROBABILISTIC NETWORK; QUALITATIVE PROPERTIES; RANDOM GRAPHS; REAL-WORLD NETWORKS; SEARCH ALGORITHMS; SOCIAL NETWORK ANALYSIS;

COMPLEX NETWORKS; LEARNING ALGORITHMS; SOCIAL NETWORKING (ONLINE);

GRAPH THEORY;

EID: 84878045441     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (67)

1. Adamic, L., Adar, E., How to search a social network. Social Networks 27 (3) (2005), 187-203.
2. Adamic, L. A., Lukose, R. M., Puniyani, A. R., Huberman, B. A., Search in Power-Law Networks. Phys. Rev. E 64 (2001), 46135-46143.
3. Aizenman, M., Newman, C. M., Discontinuity of the Percolation Density in One- Dimensional 1/|x - y|2 Percolation Models. Comm. Math. Phys. 107 (1986), 611-647.
4. Albert, R., Barabási, A.-L., Statistical mechanics of complex networks. Rev. Modern Phys. 74 (2002), 47-97.
5. Anshelevich, E., Network Design and Management with Strategic Agents. Ph.D. thesis, Cornell University, 2005.
6. Aspnes, J., Shah, G., Distributed data structures for P2P systems. In Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless and Peer-to-Peer Networks (ed. by Jie Wu, ed.), CRC Press, Boca Raton, FL, 2005, 685-700.
7. n. Bull. Soc. Math. France 111 (1983), 429-448.
8. Barabási, A.-L., Linked: the new science of networks. Perseus, Cambridge, Mass., 2002.
9. Barrière, L., Fraigniaud, P., Kranakis, E., Krizanc, D., Efficient Routing in Networks with Long Range Contacts. In Distributed Computing, Lecture Notes in Comput. Sci. 2180, Springer-Verlag, Berlin 2001, 270-284.
10. Ben-Naim, Eli, Frauenfelder, Hans, Toroczkai, Zoltan (eds.), Complex Networks. Lecture Notes in Phys. 650, Springer-Verlag, Berlin 2004.
11. Benjamini, I., Berger, N., The diameter of long-range percolation clusters on finite cycles. Random Structures Algorithms 19 (2001), 102-111.
12. Benjamini, I., Kesten, H., Peres, Y., Schramm, O., Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,. ... Ann. of Math. (2) 160 (2004), 465-491.
13. Biskup, M., On the scaling of the chemical distance in long range percolation models. Ann. Probab. 32 (2004), 2938-2977.
14. Bollobás, B., Random Graphs. 2nd edition, Cambridge Stud. Adv. Math. 73, Cambridge University Press, Cambridge 2001.
15. Bollobás, B., Mathematical results on scale-free random graphs. In Handbook of Graphs and Networks (ed. by S. Bornholdt, H. G. Schuster), Wiley/VCH, Weinheim 2003, 1-34.
16. Bollobás, B., Chung, F. R. K., The diameter of a cycle plus a random matching. SIAM J. Discrete Math. 1 (1988), 328-333.
17. Bollobás, B., de la Vega, W. F., The diameter of random regular graphs. Combinatorica 2 (1982), 125-134.
18. Clarke, I., Sandberg, O., Wiley, B., Hong, T. W., Freenet: A Distributed Anonymous Information Storage and Retrieval System. In Designing Privacy Enhancing Technologies, Lecture Notes in Comput. Sci. 2009, Springer-Verlag, Berlin 2001, 46-66
19. Clauset, A., Moore, C., How Do Networks Become Navigable? Preprint, 2003; arxiv.org, cond-mat/0309415.
20. Coppersmith, D., Gamarnik, D., Sviridenko, M., The diameter of a long-range percolation graph. Random Structures Algorithms 21 (2002), 1-13.
21. Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., and Terry, D., Epidemic algorithms for replicated database maintenance. ACMSIGOPS Operating Systems Review 22 (1) (1988), 8-32.
22. Dodds, P., Muhamad, R., Watts, D. J., An Experimental Study of Search in Global Social Networks. Science 301 (2003), 827.
23. Dorogovtsev, S. N., Mendes, J. F. F., Evolution of Networks: from biological networks to the Internet and WWW. Oxford University Press, New York 2003.
24. Duchon, P., Hanusse, N., Lebhar, E., Schabanel, N., Could any graph be turned into a small world? Theoret. Comput. Sci. 355 (1) (200), 96-103.
25. Durrett, R., Random Graph Dynamics. Cambridge University Press, Cambridge 2006.
26. Erdös, P., and Rényi, A., On the Evolution of Random Graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 (1960), 17-61.
27. Fraigniaud, P., A New Perspective on the Small-World Phenomenon: Greedy Routing in Tree-Decomposed Graphs. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA), 2005.
28. Fraigniaud, P., Gavoille, C., and Paul, C., Eclecticism shrinks even small worlds. In Proceedings of the 23rd Annual Symposium on Principles of Distributed Computing, ACM Press, New York 2004, 169-178.
29. Guare, J., Six Degrees of Separation: A Play. Vintage Books, New York 1990.
30. Gupta, A., Krauthgamer, R., and Lee, J. R., Bounded geometries, fractals, and low-distortion embeddings. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 2003, 534-543.
31. Higham, D., Greedy Pathlengths and SmallWorld Graphs. University of Strathclyde Mathematics Research Report 08, 2002.
32. Hong, T., Performance. In Peer-to-Peer: Harnessing the Power of Disruptive Technologies (ed. by A. Oram), O'Reilly and Associates, Sebastopol, CA, 2001, 203-241.
33. Jackson, M., A Survey of Models of Network Formation: Stability and Efficiency. In Group Formation in Economics; Networks, Clubs and Coalitions (ed. by G. Demange and M. Wooders), Cambridge University Press, Cambridge 2004, 11-57.
34. Kempe, D., Kleinberg, J., Demers, A., Spatial Gossip and Resource Location Protocols. In Proceedings of the 33rd Annual Symposium on Theory of Computing, ACM Press, New York 2001, 163-172.
35. Killworth, P., and Bernard, H., Reverse small world experiment. Social Networks 1 (1978), 159-192.
36. Kleinberg, J., Navigation in a Small World. Nature 406 (2000), 845.
37. Kleinberg, J., The small-world phenomenon: An algorithmic perspective. In Proceedings of the 32nd Annual Symposium on Theory of Computing, ACM Press, New York 2000, 163-170.
38. Kleinberg, J., Small-World Phenomena and the Dynamics of Information. In Advances in Neural Information Processing Systems (NIPS) 14 (2001), 431-438.
39. Kleinberg, J., Lawrence, S., The Structure of theWeb. Science 294 (2001), 1849-1850.
40. Kleinberg, J., Raghavan, P., Query Incentive Networks. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 2005.
41. Kleinfeld, J., Could it be a Big World After All? The 'Six Degrees of Separation' Myth. Society, April 2002.
42. Lebhar, E., Schabanel, N., Almost optimal decentralized routing in long-range contact networks. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), 2004.
43. Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A., Geographic routing in social networks. Proc. Natl. Acad. Sci. USA 102 (2005), 11623-11628.
44. Lua, E.-K., Crowcroft, J., Pias, M., Sharma, R., and Lim, S., A Survey and Comparison of Peer-to-Peer Overlay Network Schemes. IEEE Communications Surveys and Tutorials 7 (2005), 72-93.
45. Malkhi, D., Naor, M., Ratajczak, D., Viceroy: a scalable and dynamic emulation of the butterfly. In Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, ACM Press, New York 2002, 183-192.
46. Manku, G. S., Bawa, M., Raghavan, P., Symphony: Distributed hashing in a small world. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, USENIX, 2003, 127-140.
47. Manku, G., Naor, M., and Wieder, U., Know Thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks. In Proceedings of the 36th Annual Symposium on Theory of Computing, ACM Press, New York 2004, 54-63.
48. Martel, C., Nguyen, V., Analyzing Kleinberg's (and other) small-world models. In Proceedings of the 23rd Annual Symposium on Principles of Distributed Computing, ACM Press, New York 2004, 179-188.
49. Menczer, F., Growing and Navigating the Small World Web by Local Content. Proc. Natl. Acad. Sci. USA 99 (22) (2002), 14014-14019.
50. Milgram, S., The small world problem. Psychology Today 1 (1967), 60-67.
51. Newman, C. M., Schulman, L. S., One Dimensional 1/|j - i|s Percolation Models: The Existence of a Transition for s ≤ 2. Comm. Math. Phys. 104 (1986), 547-571.
52. Newman, M. E. J., The structure and function of complex networks. SIAM Review 45 (2003), 167-256.
53. Nguyen, V., and Martel, C., Analyzing and characterizing small-world graphs. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 2005, 311-320.
54. van Renesse, R., Birman, K. P., Vogels, W., Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Computer Sys. 21 (2003), 164-206.
55. Sandberg, O., Distributed Routing in Small-World Networks. In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments, 2006.
56. Sandberg, O., Searching a SmallWorld. Licentiate thesis, Chalmers University, 2005.
57. Schulman, L. S., Long-range percolation in one dimension. J. Phys. A 16 (17) (1986), L639-L641.
58. Simsek, O., and Jensen, D., Decentralized search in networks using homophily and degree disparity. Proceedings of the 19th International Joint Conference on Artificial Intelligence, 2005.
59. Slivkins, A., Distance Estimation and Object Location via Rings of Neighbors. In Proceedings of the 24rd Annual Symposium on Principles of Distributed Computing, ACM Press, New York 2005, 41-50.
60. Strogatz, S., Exploring complex networks. Nature 410 (2001), 268.
61. Travers, J., and Milgram, S., An experimental study of the smallworld problem. Sociometry 32 (1969), 425-443.
62. Watts, Duncan J., Six Degrees: The Science of a Connected Age.W.W. Norton, Scranton, PA, 2003.
63. Watts, D. J., Dodds, P. S., Newman, M. E. J., Identity and Search in Social Networks. Science 296 (2002), 1302-1305.
64. Watts, D. J. and Strogatz, S. H., Collective dynamics of 'small-world' networks. Nature 393 (1998), 440-442.
65. Wexler, T., Pricing Games with Selfish Users. Ph.D. thesis, Cornell University, 2005.
66. Zeng, J., Hsu, W.-J., Wang, J., Near Optimal Routing in a Small-World Network with Augmented Local Awareness. In Proceedings of the 3rd International Symposium on Parallel and Distributed Processing and Applications, 2005.
67. Zhang, H., Goel, A., Govindan, R., Using the Small-World Model to Improve Freenet Performance. In Proc. IEEE Infocom, IEEE Comput. Soc. Press, LosAlamitos, CA, 2002.