The small-world phenomenon: An algorithmic perspective

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 163-170

  Kleinberg, Jon ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

DECENTRALIZED ALGORITHMS; EXPERIMENTAL STUDIES; HIGH PROBABILITY; LOCAL INFORMATION; NETWORK MODELS; SMALL WORLD PHENOMENON; SOCIAL NETWORKS; WATTS-STROGATZ MODELS;

COMPUTATION THEORY; WORLD WIDE WEB; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS;

ALGORITHMS;

DECENTRALIZED ALGORITHMS; WATTS-STROGATZ MODELS;

EID: 0033726520     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335325     Document Type: Conference Paper

References (20)

1. L. Adamic, "The small world Web," Proceedings of the European Conf. on Digital Libraries, 1999.
2. R. Albert, H. Jeong, A.-L. Barabasi, "The diameter of the World Wide Web," Nature 401, 130 (1999).
3. P. Berman, "On-line searching and navigation," On-Line Algorithms: The State of the Art, A. Fiat and G. Woeginger, Eds., Springer, 1998.
4. B. Bollobás, Random Graphs (Academic Press, London, 1985).
5. B. Bollobás, F.R.K. Chung, "The diameter of a cycle plus a random matching," SIAM J. Discrete Math. 1, 328 (1988).
6. F.R.K. Chung, M.R. Garey, "Diameter bounds for altered graphs," J. Graph Theory 8, 511 (1984).
7. J. Guare, Six Degrees of Separation: A Play (Vintage Books, New York, 1990).
8. J. Hunter and R. Shotland, "Treating data collected by the small world method as a Markov process," Social Forces 52, 321 (1974).
9. J. Kaiser, Ed., "It's a small Web after all," Science 285, 1815 (1999).
10. P. Killworth and H. Bernard, "Reverse small world experiment," Social Networks 1,159 (1978).
11. M. Kochen, Ed., The Small World (Ablex, Norwood, 1989).
12. C. Korte and S. Milgram, "Acquaintance networks between racial groups: Application of the small world method," J. Personality and Social Psych., 15, 101 (1978).
13. S. Milgram, "The small world problem," Psychology Today 1, 61 (1967).
14. R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, Cambridge, 1995).
15. D. Peleg, E. Upfal, "A trade-off between size and efficiency for routing tables," Journal of the ACM 36(1989).
16. I. de Sola Pool and M. Kochen, "Contacts and influence," Social Networks 1, 5 (1978).
17. H. Kautz, B. Selman, M. Shah, "ReferralWeb: Combining Social Networks and Collaborative Filtering," Communications of the ACM, 30, 3 (March 1997).
18. J. Travers and S. Milgram, "An experimental study of the small world problem," Sociometry 32, 425 (1969).
19. D. Watts and S. Strogatz, "Collective dynamics of small-world networks," Nature 393, 440 (1998).
20. H. White, "Search parameters for the small world problem," Social Forces 49, 259 (1970).