Jon Kleinberg
- 1.L. Adamic, "The small world Web," Proceedings of the European Conf. on Digital Libraries, 1999.]] Google Scholar
Digital Library
- 2.R. Albert, H. Jeong, A.-L. Barabasi, "The diameter of the World Wide Web," Nature 401, 130 (1999).]]Google ScholarCross Ref
- 3.P. Berman, "On-line searching and navigation," On- Line Algorithms: The State of the Art, A. Fiat and G. Woeginger, Eds., Springer, 1998.]] Google ScholarDigital Library
- 4.B. Bollob~s, Random Graphs (Academic Press, London, 1985).]]Google Scholar
- 5.B. Bollob~s, F.R.K. Chung, "The diameter of a cycle plus a random matching," SIAM J. Discrete Math. 1, 328 (1988).]] Google ScholarDigital Library
- 6.F.R.K. Chung, M.R. Garey, "Diameter bounds for altered graphs," J. Graph Theory 8, 511 (1984).]]Google ScholarCross Ref
- 7.J. Guam, Six Degrees o/Separation: A Play (Vintage Books, New York, 1990).]]Google Scholar
- 8.J. Hunter and R. Shotland, "Treating data collected by the small world method as a Markov process," Social Forces 52, 321 (1974).]]Google ScholarCross Ref
- 9.J. Kaiser, Ed., "It's a small Web after all," Science 285, 1815 (1999).]]Google ScholarCross Ref
- 10.P. Killworth and H. Bernard, "Reverse small world experiment," Social Networks 1,159 (1978).]]Google ScholarCross Ref
- 11.M. Kochen, Ed., The Small World (Ablex, Norwood, 1989).]]Google Scholar
- 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).]]Google ScholarCross Ref
- 13.S. Milgram, "The small world problem," Psychology Today 1, 61 (1967).]]Google Scholar
- 14.R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, Cambridge, 1095).]] Google ScholarDigital Library
- 15.D. Peleg, E. Upfal, "A trade-off between size and efficiency for routing tables," Journal of the A CM 36(1989).]] Google ScholarDigital Library
- 16.I. de Sola Pool and M. Kochen, "Contacts and influence,'' Social Networks 1, 5 (1978).]]Google ScholarCross Ref
- 17.H. Kautz, B. Selman, M. Shah, "ReferralWeb: Combining Social Networks and Collaborative Filtering,'' Communications of the A CM, 30, 3 (March 1997).]] Google ScholarDigital Library
- 18.J. Travers and S. Milgram, "An experimental study of the small world problem," Sociometry 32, 425 (1969).]]Google ScholarCross Ref
- 19.D. Watts and S. Strogatz, "Collective dynamics of small-world networks," Nature 393, 440 (1998).]]Google ScholarCross Ref
- 20.H. White, "Search parameters for the small world problem," Social Forces 49, 259 (1970).]]Google ScholarCross Ref
Index Terms
- The small-world phenomenon: an algorithmic perspective
Recommendations
Invulnerability analysis of scale-free network and small-world network
AI2A '23: Proceedings of the 2023 3rd International Conference on Artificial Intelligence, Automation and AlgorithmsThis paper analyzes the invulnerability of two kinds of networks with different degrees of distribution. According to their topology, four attack strategies and two metrics were selected. The most effective attack strategy and the most appropriate ...
Small-world phenomenon of keywords network based on complex network
Based on the network comprised of 111,444 keywords of library and information science that are extracted from Scopus, and taken into consideration the major properties of average distance and clustering coefficients, the present authors, with the ...
Comments