Jon Kleinberg’s groundbreaking paper, which pointed out and then solved the small-world search problem, is available in two versions, long and short, respectively: • Kleinberg, J. The small-world phenomenon: An algorithmic perspective. In

the 32nd Annual ACM Symposium on Theory of Computing (Association of Computing Machinery, New York, 2000), pp. 163-170. ⋆⋆ Kleinberg, J. Navigation in a small world.

Nature,

406, 845 (2000).

Kleinberg later used a similar approach to study the spread of information in networks via what computer scientists call a

gossip protocol: • Kleinberg, J. Small-world phenomena and the dynamics of information. In Dietterich, T. G., Becker, S., and Ghahramani, Z. (eds.),

Advances in Neural Information Processing Systems (NIPS), 14 (MIT Press, Cambridge, MA, 2002). (4) رد علم الاجتماع

The paper that resulted from my collaboration with Mark Newman and Peter Dodds, incorporating notions of social identity and social distance into the small-world search problem, is: ⋆⋆ Watts, D. J., Dodds, P. S., and Newman, M. E. J. Identity and search in social networks.

Science,

296, 1302-1305 (2002).

Bog aan la aqoon